On approximate Nash equilibria in network design
From MaRDI portal
Publication:2808835
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
Cited in
(29)- Selfishness, collusion and power of local search for the ADMs minimization problem
- Nash Equilibria in Network Facility Location Under Delivered Prices
- Computing and Combinatorics
- 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
- scientific article; zbMATH DE number 1149752 (Why is no real title available?)
- On equilibria for ADM minimization games
- On equilibria for ADM minimization games
- Exact and Approximate Equilibria for Optimal Group Network Formation
- On the value of coordination in network design
- Near-optimal network design with selfish agents
- Contribution games in networks
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
- Non-cooperative tree creation
- Exact and approximate equilibria for optimal group network formation
- Network formation games with local coalitions
- Implementing efficient graphs in connection networks
- Efficient equilibria in polymatrix coordination games
- Near-optimal network design with selfish agents
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- Designing network protocols for good equilibria
- Strong equilibrium in cost sharing connection games
- Network cost-sharing without anonymity
- Approximative Nash-equilibria in network games
- A non-cooperative game theory approach to cost sharing in networks
- Price of stability in survivable network design
- The ring design game with fair cost allocation
- The Price of Stability for Network Design with Fair Cost Allocation
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)
