Computing solutions for matching games
From MaRDI portal
Publication:662281
DOI10.1007/s00182-011-0273-yzbMath1232.91026OpenAlexW2070240423MaRDI QIDQ662281
Walter Kern, Daniël Paulusma, Péter Biró
Publication date: 22 February 2012
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/9017/1/9017.pdf
Cooperative games (91A12) Games involving graphs (91A43) Matching models (91B68) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (14)
Population monotonicity in matching games ⋮ The stable fixtures problem with payments ⋮ Analysis of stochastic matching markets ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ Arboricity games: the core and the nucleolus ⋮ Unnamed Item ⋮ Solutions for the stable roommates problem with payments ⋮ Simple games versus weighted voting games: bounding the critical threshold value ⋮ Efficient stabilization of cooperative matching games ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ Stabilizing Weighted Graphs ⋮ The Stable Fixtures Problem with Payments ⋮ The general graph matching game: approximate core
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some simplified NP-complete graph problems
- The nucleon of cooperative games and an algorithm for matching games
- An algorithm for finding the nucleolus of assignment games
- Stable outcomes of the roommate game with transferable utility
- On the computation of the nucleolus of a cooperative game
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Consistency in one-sided assignment problems
- The assignment game. I: The core
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Vertex packings: Structural properties and algorithms
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Integer Programming: Methods, Uses, Computations
- The Nucleolus of a Characteristic Function Game
- Matching Games: The Least Core and the Nucleolus
- Approximation and Online Algorithms
This page was built for publication: Computing solutions for matching games