A network pricing game for selfish traffic

DOI10.1145/1073814.1073869zbMath1314.91063OpenAlexW2144615311MaRDI QIDQ5177250

Ara Hayrapetyan, Tom Wexler, Éva Tardos

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073869

zbMATH Keywords

game theoryprice of anarchynetwork pricing games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Applications of game theory (91A80) (n)-person games, (n>2) (91A06) Other game-theoretic models (91A40) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (6)

Price competition, free entry, and welfare in congested markets ⋮ Bertrand equilibria and efficiency in markets for congestible network services ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ Competition among providers in loss networks ⋮ Bertrand Competition in Networks ⋮ Price and capacity competition

This page was built for publication: A network pricing game for selfish traffic