The Integer Nucleolus of Directed Simple Games: A Characterization and an Algorithm

Reiner Wolff
Additional contact information
Reiner Wolff: Department of Economics, University of Fribourg, 1700 Fribourg, Switzerland

Games, 2017, vol. 8, issue 1, 1-12

Abstract: We study the class of directed simple games, assuming that only integer solutions are admitted; i.e., the players share a resource that comes in discrete units. We show that the integer nucleolus—if nonempty—of such a game is composed of the images of a particular payoff vector under all symmetries of the game. This payoff vector belongs to the set of integer imputations that weakly preserve the desirability relation between the players. We propose an algorithm for finding the integer nucleolus of any directed simple game with a nonempty integer imputation set. The algorithm supports the parallel execution of multiple threads in a computer application. We also consider the integer prenucleolus and the class of directed generalized simple games.

Keywords: integer nucleolus; integer prenucleolus; desirability relation; simple games; JEL Classification; C63; C71; D72 (search for similar items in EconPapers)
JEL-codes: C C7 C70 C71 C72 C73 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2073-4336/8/1/16/pdf (application/pdf)
https://www.mdpi.com/2073-4336/8/1/16/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jgames:v:8:y:2017:i:1:p:16-:d:91763

Access Statistics for this article

Games is currently edited by Ms. Susie Huang

More articles in Games from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().