Timing matters: online dynamics in broadcast games
From MaRDI portal
Publication:2190382
DOI10.1007/978-3-030-04612-5_6zbMath1443.91072arXiv1611.07745OpenAlexW3161990778MaRDI QIDQ2190382
Joseph (Seffi) Naor, Seeun William Umboh, Mohit Singh, Shuchi Chawla, Debmalya Panigrahi
Publication date: 18 June 2020
Full work available at URL: https://arxiv.org/abs/1611.07745
Related Items (1)
Cites Work
- Unnamed Item
- Nash equilibria with minimum potential in undirected broadcast games
- The ring design game with fair cost allocation
- Network design with weighted players
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- Strong equilibrium in congestion games
- A Shapley value representation of potential games
- Online constrained forest and prize-collecting network design
- Potential games
- On-line generalized Steiner problem
- Congestion games with player-specific payoff functions
- Timing matters: online dynamics in broadcast games
- A class of games possessing pure-strategy Nash equilibria
- Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
- A general approach to online network optimization problems
- Computing equilibria for a service provider game with (Im)perfect information
- On the Price of Stability of Undirected Multicast Games
- Exact Price of Anarchy for Polynomial Congestion Games
- The Price of Stability for Network Design with Fair Cost Allocation
- On the Price of Stability for Undirected Network Design
- The complexity of pure Nash equilibria
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- On the Value of Coordination in Network Design
- Dynamic Steiner Tree Problem
- LAST but not Least: Online Spanners for Buy-at-Bulk
- Online Buy-at-Bulk Network Design
- Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
- Online Node-Weighted Steiner Tree and Related Problems
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
This page was built for publication: Timing matters: online dynamics in broadcast games
