Network bargaining: using approximate blocking sets to stabilize unstable instances
From MaRDI portal
Publication:904691
DOI10.1007/s00224-015-9650-4zbMath1327.91019arXiv1207.6683OpenAlexW2181642337MaRDI QIDQ904691
Kate Larson, Jochen Könemann, David Steiner
Publication date: 13 January 2016
Published in: Theory of Computing Systems, Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.6683
Social networks; opinion dynamics (91D30) Applications of mathematical programming (90C90) Cooperative games (91A12) Games involving graphs (91A43) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (9)
Forming \(k\) coalitions and facilitating relationships in social networks ⋮ Stabilizing Network Bargaining Games by Blocking Players ⋮ Additive stabilizers for unstable graphs ⋮ Stabilization of capacitated matching games ⋮ Finding small stabilizers for unstable graphs ⋮ Unnamed Item ⋮ Efficient stabilization of cooperative matching games ⋮ Stabilizing network bargaining games by blocking players ⋮ Stabilizing Weighted Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- The assignment game. I: The core
- Computational Aspects of Cooperative Game Theory
- The Bargaining Problem
- Iterative Methods in Combinatorial Optimization
- On Solution Concepts for Matching Games
- The Cooperative Game Theory Foundations of Network Bargaining Games
- The Cost of Stability in Coalitional Games
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Finding Small Stabilizers for Unstable Graphs
- Convergent Transfer Schemes for N-Person Games
- The Nucleolus of a Characteristic Function Game
- Introduction to the Theory of Cooperative Games
This page was built for publication: Network bargaining: using approximate blocking sets to stabilize unstable instances
