Consistency of the equal split-off set

DOI10.1007/S00182-020-00713-5MaRDI QIDQ2021783zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 April 2021

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://research.tilburguniversity.edu/en/publications/2846ead5-71b5-4d0c-bf0b-59445287cfd1

zbMATH Keywords

consistencyegalitarianismequal split-off setexact partition gamestransferable utility games

Mathematics Subject Classification ID

Cooperative games (91A12)

Review text

The authors are interested in the axiomatic study of the equal split-of set, as a solution for cooperative games with transferable utility. By deriving several characterizations, they explore consistency of the equal split-of set on the domains of exact partition games and arbitrary games.

Recommendations

• The equal split-off set for NTU-games
• The equal split-off set for cooperative games
• THE EXTENSION OF DUTTA–RAY'S SOLUTION TO CONVEX NTU GAMES
• Axiomatizations of a class of equal surplus sharing solutions for TU-games
• The egalitarian solution for convex games: Some characterizations.

Cites work

• A Concept of Egalitarianism Under Participation Constraints
• A short proof of the inclusion of the core in the Weber set
• An axiomatic approach to egalitarianism in TU-games
• Consistency and its converse: an introduction
• Cores of convex games
• Egalitarian solutions in the core
• scientific article; zbMATH DE number 4162686 (Why is no real title available?)
• On Lorenz dominance and the Dutta-Ray algorithm
• On the existence of the Dutta-Ray's egalitarian solution
• On the reduced game property and its converse
• On the set of Lorenz-maximal imputations in the core of a balanced game
• Potential, Value, and Consistency
• Reduced games and egalitarian solutions
• Reduced games, consistency, and the core
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• The egalitarian solution and reduced game properties in convex games
• The egalitarian solution for convex games: Some characterizations.
• The equal split-off set for cooperative games
• The kernel of a cooperative game
• The separability axiom and equal-sharing methods

Cited in

(7)

• The balanced contributions property for equal contributors
• Axiomatizations of Dutta-Ray's egalitarian solution on the domain of convex games
• Self-antidual extensions and subsolutions
• The equal split-off set for NTU-games
• The equal split-off set for cooperative games
• Core bound reduced games and consistency
• Population monotonicity and egalitarianism

This page was built for publication: Consistency of the equal split-off set

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