scientific article; zbMATH DE number 7378728
From MaRDI portal
Publication:5009624
DOI10.4230/LIPICS.ESA.2018.58MaRDI QIDQ5009624
Phani Raj Lolakapuri, Umang Bhaskar
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1804.10044
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Worst-case equilibria
- Stackelberg strategies and collusion in network games with splittable flow
- Selfish load balancing and atomic congestion games
- Nash and correlated equilibria: Some complexity considerations
- Local smoothness and the price of anarchy in splittable congestion games
- Collusion in atomic splittable routing games
- Equilibrium computation in atomic splittable singleton congestion games
- A class of games possessing pure-strategy Nash equilibria
- The effect of collusion in congestion games
- On the Complexity of Approximating a Nash Equilibrium
- The Impact of Oligopolistic Competition in Networks
- The effectiveness of stackelberg strategies and tolls for network congestion games
- On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
- The Price of Collusion in Series-Parallel Networks
- The complexity of pure Nash equilibria
- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
- Algorithms for the Network Oligopoly Problem
- Computing network tolls with support constraints
- Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria
- Competitive routing in networks with polynomial costs
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
This page was built for publication:
