C-complete sets for compromise stable games
AbstractThe core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an ordering of the players and describes the efficient payoff vector giving the first players in the ordering their utopia demand as long as it is still possible to assign the remaining players at least their minimum right. A game is called compromise stable if the core is equal to the core cover, i.e. the core is the convex hull of the larginal vectors. This paper analyzes the structure of orderings corresponding to larginal vectors of the core cover and conditions ensuring equality between core cover and core. We introduce compromise complete (or c-complete) sets that satisfy the condition that if every larginal vector corresponding to an ordering of the set is a core element, then the game is compromise stable. We use combinatorial arguments to give a complete characterization of these sets. More specifically, we find c-complete sets of minimum cardinality and a closed formula for the minimum number of orderings in c-complete sets.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Department of Business and Economics, University of Southern Denmark in its series Discussion Papers of Business and Economics with number 25/2012.
Length: 14 pages
Date of creation: 03 Dec 2012
Date of revision:
Contact details of provider:
Postal: Department of Business and Economics, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark
Phone: 65 50 32 33
Fax: 65 50 32 37
Web page: http://www.sdu.dk/ivoe
More information through EDIRC
Core; core cover; larginal vectors;
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2012-12-15 (All new papers)
- NEP-GTH-2012-12-15 (Game Theory)
- NEP-MIC-2012-12-15 (Microeconomics)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Potters, Jos & Poos, Rene & Tijs, Stef & Muto, Shigeo, 1989. "Clan games," Games and Economic Behavior, Elsevier, vol. 1(3), pages 275-293, September.
- Velzen, S. van & Hamers, H.J.M. & Norde, H.W., 2003. "Characterizing Convexity of Games using Marginal Vectors," Discussion Paper 2003-11, Tilburg University, Center for Economic Research.
- Tijs, S.H. & Lipperts, F.A.S., 1982. "The hypercube and the core cover of N-person cooperative games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154285, Tilburg University.
- Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
- Muto, S. & Nakayama, M. & Potters, J.A.M. & Tijs, S.H., 1988. "On big boss games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154246, Tilburg University.
- Velzen, S. van & Hamers, H.J.M. & Norde, H.W., 2002. "Convexity and Marginal Vectors," Discussion Paper 2002-53, Tilburg University, Center for Economic Research.
- Potters, J.A.M. & Poos, R. & Tijs, S.H. & Muto, S., 1989. "Clan games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154241, Tilburg University.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lene Holbæk).
If references are entirely missing, you can add them using this form.