This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

On the vertices of the k-addiive core

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Michel Grabisch () (CES - Centre d'économie de la Sorbonne - CNRS : UMR8174 - Université Panthéon-Sorbonne - Paris I)
Pedro Miranda () (Universidad Complutense de Madrid - Universidad Complutense de Madrid)

Additional information is available for the following registered author(s):

Abstract

The core of a game $v$ on $N$, which is the set of additive games $\phi$ dominating $v$ such that $\phi(N)=v(N)$, is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular functions, matroids and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define the $k$-additive core by replacing additive games by $k$-additive games in the definition of the core, where $k$-additive games are those games whose Möbius transform vanishes for subsets of more than $k$ elements. For a sufficiently high value of $k$, the $k$-additive core is nonempty, and is a convex closed polyhedron. Our aim is to establish results similar to the classical results of Shapley and Ichiishi on the core of convex games (corresponds to Edmonds' theorem for the greedy algorithm), which characterize the vertices of the core.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://hal.archives-ouvertes.fr/docs/00/32/16/25/PDF/dm07.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by HAL in its series Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) with number hal-00321625_v1.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Nov 2008
Date of revision:
Publication status: Published, Discrete Mathematics, 2008, 308, 22, 5204-5217
Handle: RePEc:hal:cesptp:hal-00321625_v1

Note: View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00321625/en/
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/

For technical questions regarding this item, or to correct its listing, contact: (CCSD).

Related research
Keywords: Cooperative games; Core; k-additive games; Vertices;

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? You can import bibliographic info in various formats into you bibliographic tool, or just into your word processor. See under "publisher info" on each abstract page.

This page was last updated on 2009-11-24.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.