Stabilizing Network Bargaining Games by Blocking Players

DOI10.1007/978-3-319-33461-5_14zbMath1422.91142OpenAlexW2480955850MaRDI QIDQ3186500

Laura Sanità, Hamideh Hosseinzadeh, Sara Ahmadian

Publication date: 10 August 2016

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33461-5_14

zbMATH Keywords

network bargaining gamesblocking players

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Combinatorial optimization (90C27)

Related Items (7)

Forming \(k\) coalitions and facilitating relationships in social networks ⋮ The stable fixtures problem with payments ⋮ Additive stabilizers for unstable graphs ⋮ Unnamed Item ⋮ Efficient stabilization of cooperative matching games ⋮ Graph Stabilization: A Survey ⋮ Stabilizing Weighted Graphs

Cites Work

• 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
• Network bargaining: using approximate blocking sets to stabilize unstable instances
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The assignment game. I: The core
• 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
• Solutions for the Stable Roommates Problem with Payments
• Approximate max-flow min-(multi)cut theorems and their applications
• Paths, Trees, and Flowers
• Finding Small Stabilizers for Unstable Graphs
• Algorithmic Game Theory

This page was built for publication: Stabilizing Network Bargaining Games by Blocking Players