On approximate Nash equilibria in network design

DOI10.1080/15427951.2012.754800zbMATH Open1341.91022OpenAlexW1974040162MaRDI QIDQ2808835FDOQ2808835

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

Recommendations

Approximative Nash-equilibria in network games
Computing approximate Nash equilibria in network congestion games
Computing Approximate Nash Equilibria in Network Congestion Games
Improved bounds on equilibria solutions in the network design game
Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
Near-optimal network design with selfish agents
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

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10) Games involving graphs (91A43)

Cited In (29)

Nash equilibria with minimum potential in undirected broadcast games
\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
Nash equilibria with minimum potential in undirected broadcast games
Efficient equilibria in polymatrix coordination games
Near-optimal network design with selfish agents
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
Exact and Approximate Equilibria for Optimal Group Network Formation
A non-cooperative game theory approach to cost sharing in networks
Strong equilibrium in cost sharing connection games
Network formation games with local coalitions
Computing and Combinatorics
Non-cooperative tree creation
The ring design game with fair cost allocation
On the value of coordination in network design
Designing network protocols for good equilibria
Network cost-sharing without anonymity
Price of stability in survivable network design
Exact and approximate equilibria for optimal group network formation
The Price of Stability for Network Design with Fair Cost Allocation
Contribution games in networks
Selfishness, collusion and power of local search for the ADMs minimization problem
Implementing efficient graphs in connection networks
Approximative Nash-equilibria in network games
Title not available (Why is that?)
On equilibria for ADM minimization games
On equilibria for ADM minimization games
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions

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)