Internalization of social cost in congestion games
From MaRDI portal
Publication:2061126
DOI10.1007/s00199-020-01274-0zbMath1479.91028OpenAlexW3021969029MaRDI QIDQ2061126
Publication date: 13 December 2021
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00199-020-01274-0
Related Items (1)
Cites Work
- Unnamed Item
- Representation of finite games as network congestion games
- Comparative statics of altruism and spite
- Network topology and equilibrium existence in weighted network congestion games
- Network topology and the efficiency of equilibrium
- Inefficiency of games with social context
- Equilibria for networks with malicious users
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Efficient graph topologies in network routing games
- Strong equilibrium in congestion games
- Network structure and strong equilibrium in route selection games.
- Social optimality and cooperation in nonatomic congestion games.
- Potential games
- The dynamic evolution of preferences
- Greediness and equilibrium in congestion games
- Comparative statics of games between relatives
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Bounding the Inefficiency of Altruism through Social Contribution Games
- The Impact of Oligopolistic Competition in Networks
- Malicious Bayesian Congestion Games
- Competitive routing in networks with polynomial costs
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
This page was built for publication: Internalization of social cost in congestion games
