Cores of convex games

1971/12/01 by Lloyd S. Shapley · 10 citations

paper · doi:10.1007/bf01753431

crossref issued 1971/12/01 · crossref published 1971/12/01 · crossref published-print 1971/12/01 · crossref created 2005/06/15 · crossref deposited 2019/05/08 · crossref indexed 2026/07/26

Cited by

• Fair Indivisible Payoffs through Shapley Value
• Teacher transfers: equalizing deficits across schools
• Generating Fair Consensus Statements with Social Choice on Token-Level MDPs
• Equilibria in routing games with connected autonomous vehicles will not be strong, as exclusive clubs may form
• A Linear Programming Approach to Estimate the Core in Cooperative Games
• Many rays of the submodular cone
• Procedural Fairness in Multi-Agent Bandits
• A Coalitional Stable and Fair Reward Allocation for Dynamic Virtual Power Plants
• Choquet integration with submodular function on measurable space with sigma-algebra generating chain
• Data-Driven Approach to Model the Influence of Magnetic Geometry in the Confinement of Fusion Devices