Population monotonicity in matching games
From MaRDI portal
Publication:2136163
Abstract: A matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings in the subgraph induced by the coalition. A population monotonic allocation scheme is a collection of rules defining how to share the profit among players in each coalition such that every player is better off when the coalition expands. In this paper, we study matching games and provide a necessary and sufficient characterization for the existence of population monotonic allocation schemes. Our characterization also implies that whether a matching game admits population monotonic allocation schemes can be determined efficiently.
Recommendations
- Population monotonic allocation schemes for vertex cover games
- Population monotonic allocation schemes for cooperative games with transferable utility
- A combinatorial characterization for population monotonic allocations in convex independent set games
- A dual description of the class of games with a population monotonic allocation scheme
- Matching Games: The Least Core and the Nucleolus
Cites work
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- An algorithm for finding the nucleolus of assignment games
- An axiomatization of the nucleolus of assignment markets
- Assignment games with stable core
- Axiomatization of the core of assignment games
- Characterization of the extreme core allocations of the assignment game.
- Computing solutions for matching games
- Consistency in one-sided assignment problems
- Generalized Ramsey theory for graphs, X: Double stars
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Limitations of cross-monotonic cost-sharing schemes
- Matching Games: The Least Core and the Nucleolus
- Population monotonic allocation schemes for cooperative games with transferable utility
- Stable outcomes of the roommate game with transferable utility
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- The assignment game. I: The core
- The general graph matching game: approximate core
- The nucleon of cooperative games and an algorithm for matching games
- Totally balanced combinatorial optimization games
Cited in
(12)- Monotone Matching in Perfect and Imperfect Worlds
- Regular population monotonic allocation schemes
- Population monotonic allocation schemes for vertex cover games
- scientific article; zbMATH DE number 1082115 (Why is no real title available?)
- A dual description of the class of games with a population monotonic allocation scheme
- On the population monotonicity of independent set games
- Population monotonic allocation schemes on externality games
- Assignment games with population monotonic allocation schemes
- Population monotonic path schemes for simple games
- The mask game with multiple populations
- Population monotonic solutions on convex games
- A combinatorial characterization for population monotonic allocations in convex independent set games
This page was built for publication: Population monotonicity in matching games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136163)
