Cooperative networks games with elastic demands
From MaRDI portal
Publication:3515388
DOI10.1051/ro:2007034zbMath1144.91303OpenAlexW2095128356MaRDI QIDQ3515388
Alain Quilliot, Fatiha Bendali, Jean Mailfert
Publication date: 29 July 2008
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_4_345_0
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the core of network synthesis games
- The Aumann-Shapley price mechanism for allocating congestion costs
- On the convergence to Nash equilibrium in problems of distributed computing
- Equilibrium, games, and pricing in transportation and telecommunication networks
- Resource pricing and the evolution of congestion control
- Spanning network games.
- A survey on networking games in telecommunications
- Non-cooperative games
- Capacity allocation under noncooperative routing
- Totally balanced games arising from controlled programming problems
- On the core and nucleolus of minimum cost spanning tree games
- On the relationship between Nash—Cournot and Wardrop equilibria
- Totally Balanced Games and Games of Flow
- On Some Network Flow Games
- On cost allocation for a spanning tree: A game theoretic approach
- Cost allocation for steiner trees
- A Game Theoretic Approach to Problems in Telecommunication
- Constrained traffic equilibrium in routing
- Mixed equilibrium (ME) for multiclass routing games
- A Competitive Network Design Problem with Pricing
- Competitive Location Models: A Framework and Bibliography
This page was built for publication: Cooperative networks games with elastic demands