Artikel
The integer nucleolus of directed simple games: A characterization and an algorithm
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.
- Language
-
Englisch
- Bibliographic citation
-
Journal: Games ; ISSN: 2073-4336 ; Volume: 8 ; Year: 2017 ; Issue: 1 ; Pages: 1-12 ; Basel: MDPI
- Classification
-
Wirtschaft
Computational Techniques; Simulation Modeling
Cooperative Games
Political Processes: Rent-seeking, Lobbying, Elections, Legislatures, and Voting Behavior
- Subject
-
integer nucleolus
integer prenucleolus
desirability relation
simple games
- Event
-
Geistige Schöpfung
- (who)
-
Wolff, Reiner
- Event
-
Veröffentlichung
- (who)
-
MDPI
- (where)
-
Basel
- (when)
-
2017
- DOI
-
doi:10.3390/g8010016
- Handle
- Last update
-
10.03.2025, 11:42 AM CET
Data provider
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Artikel
Associated
- Wolff, Reiner
- MDPI
Time of origin
- 2017
Other Objects (12)
A stable integer relation algorithm
Simple Integer Recourse Models
A simple OPT + 1 algorithm for cutting stock under the modified integer round-up property assumption
Directed and weighted majority games
Local Simple Games
Simple Games versus Weighted Voting Games
A reduction algorithm for integer multiple objective linear programs
The Nucleolus of Directed Acyclic Graph Games
A Simple Game of Exchange
Runtime Analyses for a Simple Multiobjective Evolutionary Algorithm
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
On the Core of Directed Acyclic Graph Games
A stable integer relation algorithm
Simple Integer Recourse Models
A simple OPT + 1 algorithm for cutting stock under the modified integer round-up property assumption
Directed and weighted majority games
Local Simple Games
Simple Games versus Weighted Voting Games
A reduction algorithm for integer multiple objective linear programs
The Nucleolus of Directed Acyclic Graph Games
A Simple Game of Exchange
Runtime Analyses for a Simple Multiobjective Evolutionary Algorithm
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
On the Core of Directed Acyclic Graph Games
A stable integer relation algorithm
Simple Integer Recourse Models
A simple OPT + 1 algorithm for cutting stock under the modified integer round-up property assumption
Directed and weighted majority games
Local Simple Games
Simple Games versus Weighted Voting Games
A reduction algorithm for integer multiple objective linear programs
The Nucleolus of Directed Acyclic Graph Games
A Simple Game of Exchange
Runtime Analyses for a Simple Multiobjective Evolutionary Algorithm
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization