Stabilizing network bargaining games by blocking players
DOI10.1007/s10107-017-1177-9zbMath1398.05132OpenAlexW2738541582MaRDI QIDQ1801001
Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità
Publication date: 26 October 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1177-9
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43) Other game-theoretic models (91A40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient stabilization of cooperative matching games
- A characterization of the graphs in which the transversal number equals the matching number
- The complexity of König subgraph problems and above-guarantee vertex cover
- Finding small stabilizers for unstable graphs
- Network bargaining: using approximate blocking sets to stabilize unstable instances
- Asymptotically optimal switching circuits
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Solutions for the stable roommates problem with payments
- The assignment game. I: The core
- Pseudorandomness
- Computational Aspects of Cooperative Game Theory
- The Bargaining Problem
- TWO THEOREMS IN GRAPH THEORY
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- The Minimum Satisfiability Problem
- Approximate max-flow min-(multi)cut theorems and their applications
- Paths, Trees, and Flowers
- Algorithmic Game Theory
This page was built for publication: Stabilizing network bargaining games by blocking players
