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

DOI10.3390/g8010016zbMath1407.91034OpenAlexW2592152891MaRDI QIDQ725102

Reiner Wolff

Publication date: 1 August 2018

Published in: Games (Search for Journal in Brave)

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

zbMATH Keywords

simple gamesdesirability relationinteger nucleolusinteger prenucleolus

Mathematics Subject Classification ID

Cooperative games (91A12)

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bankruptcy problems with non-integer claims: definition and characterizations of the ICEA solution
• Integer solutions to bankruptcy problems with non-integer claims
• Finding the nucleoli of large cooperative games
• Remarks on the integer Talmud solution for integer bankruptcy problems
• Complete simple games
• The nucleolus of large majority games
• A characterization, existence proof and dimension bounds for the kernel of a game
• Common mistakes in computing the nucleolus
• Analytic solution for the nucleolus of a three-player cooperative game
• Fast algorithms for genegrating integer partitions
• The Counting Vector of a Simple Game
• Directed and weighted majority games
• On the Enumeration of Majority Games
• On Weights of Constant-Sum Majority Games
• The Nucleolus of a Characteristic Function Game

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