Social optimality and cooperation in nonatomic congestion games.
From MaRDI portal
(Redirected from Publication:1421898)
Recommendations
- Finding social optima in congestion games with positive externalities
- Approximate Pure Nash Equilibria in Social Context Congestion Games
- Equilibrium and potential in coalitional congestion games
- On linear congestion games with altruistic social context
- Optimal Mechanisms for Robust Coordination in Congestion Games
- Altruism in Atomic Congestion Games
- Coalitions in nonatomic network congestion games
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Maximizing social welfare in congestion games via redistribution
Cites work
- scientific article; zbMATH DE number 2202834 (Why is no real title available?)
- scientific article; zbMATH DE number 3204221 (Why is no real title available?)
- A Simplified Bargaining Model for the n-Person Cooperative Game
- A class of games possessing pure-strategy Nash equilibria
- Bounding the inefficiency of equilibria in nonatomic congestion games
- CONGESTION GAMES AND POTENTIALS RECONSIDERED
- Congestion models and weighted Bayesian potential games
- Congestion tolls: Equilibrium and optimality
- Correlated equilibrium and potential games
- Equilibrium points of nonatomic games
- Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
- Generic uniqueness of equilibrium in large crowding games
- Potential games
- Power and taxes in a multi-commodity economy
- Relations among certain ranges of vector measures
- Two-Person Cooperative Games
- Values of Non-Atomic Games
- Vector measure games based on measures with values in an infinite dimensional vector space
Cited in
(24)- Finding social optima in congestion games with positive externalities
- Cooperative congestion games: existence of a Nash-stable coalition structure
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Comparative statics of altruism and spite
- Robust perfect equilibrium in large games
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium
- A geometric approach to the price of anarchy in nonatomic congestion games
- Pricing of fluctuations in electricity markets
- An overview on game theory applications to engineering
- Strong equilibrium in cost sharing connection games
- Pure Nash equilibria in player-specific and weighted congestion games
- On the price of anarchy of highly congested nonatomic network games
- Network topology and the efficiency of equilibrium
- Optimal externalities in a parallel transportation network
- The price of anarchy in nonatomic consumption-relevance congestion games
- Coalitions in nonatomic network congestion games
- Price of anarchy for highly congested routing games in parallel networks
- Internalization of social cost in congestion games
- Truthful mechanisms for selfish routing and two-parameter agents
- Public congestion network situations and related games
- On optimal congestion
- Informational Braess' paradox: the effect of information on traffic congestion
- On weak Pareto optimality of nonatomic routing networks
- Harsh environments: multi-player cooperation with excludability and congestion
This page was built for publication: Social optimality and cooperation in nonatomic congestion games.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1421898)
