The uniqueness property for networks with several origin-destination pairs
From MaRDI portal
Publication:2514826
DOI10.1016/j.ejor.2014.01.041zbMath1304.91044arXiv1206.5120OpenAlexW1965089147MaRDI QIDQ2514826
Thomas Pradeau, Frédéric Meunier
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.5120
Related Items (4)
Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ Nonatomic aggregative games with infinitely many types ⋮ Strategic decentralization in binary choice composite congestion games ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selfish routing in public services
- Distributed consensus in noncooperative inventory games
- A direct proof of the existence of pure strategy equilibria in games with a continuum of players
- Congestion games with player-specific payoff functions
- Equilibrium points of nonatomic games
- Generic Uniqueness of Equilibrium in Large Crowding Games
- The Impact of Oligopolistic Competition in Networks
- How bad is selfish routing?
- Equilibria on a Congested Transportation Network
- Optimal Load Balancing on Sonet Bidirectional Rings
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
- Über ein Paradoxon aus der Verkehrsplanung
- Topological Conditions for Uniqueness of Equilibrium in Networks
- Combinatorial optimization. Theory and algorithms
This page was built for publication: The uniqueness property for networks with several origin-destination pairs