Truthful mechanisms for selfish routing and two-parameter agents
From MaRDI portal
Publication:647482
DOI10.1007/S00224-010-9281-8zbMath1278.91035OpenAlexW2097738267MaRDI QIDQ647482
Clemens Thielen, Sven O. Krumke
Publication date: 23 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-15872
Cooperative games (91A12) Games involving graphs (91A43) Applications of game theory (91A80) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Internet topics (68M11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Social optimality and cooperation in nonatomic congestion games.
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Equilibrium points of nonatomic games
- How much can taxes help selfish routing?
- A class of games possessing pure-strategy Nash equilibria
- Generic Uniqueness of Equilibrium in Large Crowding Games
- How bad is selfish routing?
- Sensitivity analysis for the asymmetric network equilibrium problem
- Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation
- On the Inefficiency of Equilibria in Congestion Games
- Algorithmic mechanism design
This page was built for publication: Truthful mechanisms for selfish routing and two-parameter agents
