The price of optimum: complexity and approximation for a matching game
From MaRDI portal
Publication:521813
DOI10.1007/s00453-015-0108-5zbMath1411.91138OpenAlexW2229724450MaRDI QIDQ521813
Laurent Gourvès, Bruno Escoffier, Jérôme Monnot
Publication date: 12 April 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0108-5
Analysis of algorithms and problem complexity (68Q25) Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case equilibria
- On the hardness of approximating minimum vertex cover
- Stackelberg thresholds in network routing games or the value of altruism
- Coordination mechanisms
- Stackelberg strategies for atomic congestion games
- Strong price of anarchy
- Some APX-completeness results for cubic graphs
- Alternating paths in edge-colored complete graphs
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Non-cooperative games
- Stackelberg Routing in Arbitrary Networks
- How bad is selfish routing?
- Stackelberg Scheduling Strategies
- Algorithms, games, and the internet
- College Admissions and the Stability of Marriage
This page was built for publication: The price of optimum: complexity and approximation for a matching game
