Wealth Inequality and the Price of Anarchy

DOI10.4230/LIPIcs.STACS.2019.31OpenAlexW2962733547MaRDI QIDQ5090481

Kurtuluş Gemici, Elias Koutsoupias, Barnabé Monnot, Georgios Piliouras, Christos H. Papadimitriou

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1802.09269

zbMATH Keywords

inequalitycongestion games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach ⋮ The price of anarchy in routing games as a function of the demand ⋮ The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context

Cites Work

• Unnamed Item
• Achieving target equilibria in network routing games without knowing the latency functions
• Selfish unsplittable flows
• Selfish Transportation Games
• How bad is selfish routing?
• Pricing network edges for heterogeneous selfish users
• The price of anarchy of finite congestion games
• Mechanism Design with Efficiency and Equality Considerations
• Routing Games in the Wild: Efficiency, Equilibration and Regret
• Computing network tolls with support constraints
• Intrinsic robustness of the price of anarchy
• Routing without regret
• Selfish Routing in Capacitated Networks

This page was built for publication: Wealth Inequality and the Price of Anarchy