The integer nucleolus of directed simple games: a characterization and an algorithm

DOI10.3390/G8010016MaRDI QIDQ725102zbMATH OpenOpenAlexFDO

Authors Reiner Wolff

Publication date 1 August 2018

Published in Games (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/g8010016

zbMATH Keywords

desirability relationinteger nucleolusinteger prenucleolussimple games

Mathematics Subject Classification ID

Cooperative games (91A12)

Review text

Summary: 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.

Recommendations

• On the core and nucleolus of directed acyclic graph games
• Characterization of the nucleolus for a class ofn-person games
• Computing the nucleolus of some combinatorially-structured games.
• scientific article; zbMATH DE number 4152185
• On the computation of the nucleolus of a cooperative game
• An algorithm for finding the nucleolus of assignment games
• scientific article; zbMATH DE number 1187071
• On computing the nucleolus of a balanced connected game
• An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure
• On finding the nucleolus of an n-person cooperative game

Cites work

• A characterization, existence proof and dimension bounds for the kernel of a game
• Analytic solution for the nucleolus of a three-player cooperative game
• Bankruptcy problems with non-integer claims: definition and characterizations of the ICEA solution
• Common mistakes in computing the nucleolus
• Complete simple games
• Directed and weighted majority games
• Fast algorithms for genegrating integer partitions
• Finding the nucleoli of large cooperative games
• scientific article; zbMATH DE number 3943824 (Why is no real title available?)
• scientific article; zbMATH DE number 3495908 (Why is no real title available?)
• scientific article; zbMATH DE number 1099365 (Why is no real title available?)
• scientific article; zbMATH DE number 1357433 (Why is no real title available?)
• Integer solutions to bankruptcy problems with non-integer claims
• On the Enumeration of Majority Games
• On Weights of Constant-Sum Majority Games
• Remarks on the integer Talmud solution for integer bankruptcy problems
• The Counting Vector of a Simple Game
• The Nucleolus of a Characteristic Function Game
• The nucleolus of large majority games

Cited in

(1)

• The nucleolus of balanced simple flow networks

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: The integer nucleolus of directed simple games: a characterization and an algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725102)