Minimizing Rosenthal potential in multicast games
From MaRDI portal
Publication:493648
DOI10.1007/s00224-014-9573-5zbMath1329.68041OpenAlexW2145101967WikidataQ60488394 ScholiaQ60488394MaRDI QIDQ493648
Michał Pilipczuk, Jesper Nederlof, Petr A. Golovach, Fedor V. Fomin
Publication date: 4 September 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-014-9573-5
Noncooperative games (91A10) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Network protocols (68M12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Local search: is brute-force avoidable?
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
- Worst-case equilibria
- Theoretical aspects of local search.
- On the parameterized complexity of multiple-interval graph problems
- Cost-sharing mechanisms for network design
- Parametrized complexity theory.
- A class of games possessing pure-strategy Nash equilibria
- Designing Network Protocols for Good Equilibria
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- Quantifying inefficiency in cost-sharing mechanisms
- Approximation via cost sharing
- On the Value of Coordination in Network Design
- The steiner problem in graphs
