Nonatomic aggregative games with infinitely many types
From MaRDI portal
Publication:2140304
Abstract: We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games with an infinity of players types. These equilibria are characterized through an infinite-dimensional variational inequality. We show, under monotonicity conditions, a convergence theorem enables to approximate such an equilibrium with arbitrary precision. To this end, we introduce a sequence of nonatomic games with a finite number of players types, which approximates the initial game. We show the existence of a symmetric Wardrop equilibrium in each of these games. We prove that those symmetric equilibria converge to an equilibrium of the infinite game, and that they can be computed as solutions of finite-dimensional variational inequalities. The model is illustrated through an example from smart grids: the description of a large population of electricity consumers by a parametric distribution gives a nonatomic game with an infinity of different players types, with actions subject to coupling constraints.
Recommendations
- Nonatomic potential games: the continuous strategy case
- Rare Nash equilibria and the price of anarchy in large static games
- Finite composite games: equilibria and dynamics
- Distributed convergence to Nash equilibria in network and average aggregative games
- Atomic congestion games with random players: network equilibrium and the price of anarchy
Cites work
- scientific article; zbMATH DE number 3835792 (Why is no real title available?)
- scientific article; zbMATH DE number 1233801 (Why is no real title available?)
- scientific article; zbMATH DE number 1059230 (Why is no real title available?)
- scientific article; zbMATH DE number 3351304 (Why is no real title available?)
- A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
- A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
- A direct proof of the existence of pure strategy equilibria in games with a continuum of players
- A duopoly model with heterogeneous congestion-sensitive customers
- An elementary proof that integration preserves uppersemicontinuity
- An extended descent framework for variational inequalities
- Coalitions in nonatomic network congestion games
- Combinatorial behavior of extreme points of perturbed polyhedra
- Comparative statics for aggregative games. The strong concavity case
- Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
- Decomposition algorithms for generalized potential games
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- Equilibrium points of nonatomic games
- Evolutionarily stable strategies and game dynamics
- Evolutionary Games and Population Dynamics
- Evolutionary dynamics on infinite strategy spaces
- Finite composite games: equilibria and dynamics
- Formulation, stability, and computation of traffic network equilibria as projected dynamical systems
- Generalized Nash games and quasi-variational inequalities
- Generic uniqueness of equilibrium in large crowding games
- Handbooks in operations Research \& management science: Transportation
- Imitative dynamics for games with continuous strategy space
- Infinite dimensional analysis. A hitchhiker's guide.
- Integrals of set-valued functions
- Mathematical structure of a bilevel strategic pricing model
- Monotone generalized variational inequalities and generalized complementarity problems
- NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
- Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
- Nash equilibria, variational inequalities, and dynamical systems
- Network-Optimized Road Pricing: Part I: A Parable and a Model
- On a theorem of Schmeidler
- On some non-linear elliptic differential functional equations
- On the dynamic foundation of evolutionary stability in continuous models.
- On the existence of pure-strategy equilibria in large games
- On the relationship between Nash—Cournot and Wardrop equilibria
- Pairwise comparison dynamics for games with continuous strategy space
- Potential games with continuous player sets
- Selfish Routing in Capacitated Networks
- Sensitivity analysis for the asymmetric network equilibrium problem
- Stable games and their dynamics
- The network equilibrium problem in integers
- The uniqueness property for networks with several origin-destination pairs
Cited in
(4)
This page was built for publication: Nonatomic aggregative games with infinitely many types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140304)
