On approximate Nash equilibria in network design
From MaRDI portal
Publication:2808835
DOI10.1080/15427951.2012.754800zbMATH Open1341.91022OpenAlexW1974040162MaRDI QIDQ2808835FDOQ2808835
Pascal Lenzner, Susanne Albers
Publication date: 25 May 2016
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2012.754800
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10) Games involving graphs (91A43)
Cited In (6)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- Near-optimal network design with selfish agents
- Nash Equilibria in Network Facility Location Under Delivered Prices
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
- Title not available (Why is that?)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Computing approximate Nash equilibria in network congestion games π π
- Computing Approximate Nash Equilibria in Network Congestion Games π π
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks π π
- Near-optimal network design with selfish agents π π
- A game-theoretic approach to network equilibrium π π
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions π π
- Improved bounds on equilibria solutions in the network design game π π
This page was built for publication: On approximate Nash equilibria in network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808835)