A network pricing game for selfish traffic
From MaRDI portal
Publication:1954204
DOI10.1007/s00446-006-0020-yzbMath1266.91005MaRDI QIDQ1954204
Tom Wexler, Ara Hayrapetyan, Éva Tardos
Publication date: 20 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-006-0020-y
Related Items
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators, Network investment games with Wardrop followers, Strategic pricing in next-hop routing with elastic demands, Toll caps in privatized road networks, Constraint games for stable and optimal allocation of demands in SDN, A unifying approximate potential for weighted congestion games, The Cost of Free Spectrum, Price competition with elastic traffic
Cites Work
- Unnamed Item
- Unnamed Item
- How much can taxes help selfish routing?
- On a network creation game
- How bad is selfish routing?
- Competition in Service Industries
- The Price of Stability for Network Design with Fair Cost Allocation
- Selfish traffic allocation for server farms
- Near-optimal network design with selfish agents
- Pricing network edges for heterogeneous selfish users
- Stackelberg scheduling strategies
- Competition and Efficiency in Congested Markets
- Selfish Routing in Capacitated Networks
- The price of anarchy is independent of the network topology