Nonatomic aggregative games with infinitely many types
From MaRDI portal
Publication:2140304
DOI10.1016/J.EJOR.2021.11.025zbMATH Open1506.91005arXiv1906.01986OpenAlexW2948200353MaRDI QIDQ2140304FDOQ2140304
Authors: Paulin Jacquot, Cheng Wan 
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1906.01986
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
game theorygeneralized variational inequalityvariational equilibriummonotone gamecoupling aggregative constraintsnonatomic aggregative game
Noncooperative games (91A10) Variational inequalities (49J40) Games with infinitely many players (91A07)
Cites Work
- Selfish Routing in Capacitated Networks
- Evolutionarily stable strategies and game dynamics
- Formulation, stability, and computation of traffic network equilibria as projected dynamical systems
- On some non-linear elliptic differential functional equations
- Title not available (Why is that?)
- Evolutionary Games and Population Dynamics
- Infinite dimensional analysis. A hitchhiker's guide.
- Generalized Nash games and quasi-variational inequalities
- On the dynamic foundation of evolutionary stability in continuous models.
- Stable games and their dynamics
- Finite composite games: equilibria and dynamics
- Coalitions in nonatomic network congestion games
- Handbooks in operations Research \& management science: Transportation
- A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
- On the relationship between Nash—Cournot and Wardrop equilibria
- Title not available (Why is that?)
- Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
- Evolutionary dynamics on infinite strategy spaces
- Potential games with continuous player sets
- A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
- Comparative statics for aggregative games. The strong concavity case
- Integrals of set-valued functions
- Monotone generalized variational inequalities and generalized complementarity problems
- Generic uniqueness of equilibrium in large crowding games
- Equilibrium points of nonatomic games
- An elementary proof that integration preserves uppersemicontinuity
- Nash equilibria, variational inequalities, and dynamical systems
- Decomposition algorithms for generalized potential games
- The network equilibrium problem in integers
- A duopoly model with heterogeneous congestion-sensitive customers
- On a theorem of Schmeidler
- The uniqueness property for networks with several origin-destination pairs
- Imitative dynamics for games with continuous strategy space
- Pairwise comparison dynamics for games with continuous strategy space
- On the existence of pure-strategy equilibria in large games
- Sensitivity analysis for the asymmetric network equilibrium problem
- An extended descent framework for variational inequalities
- A direct proof of the existence of pure strategy equilibria in games with a continuum of players
- Title not available (Why is that?)
- Title not available (Why is that?)
- Network-Optimized Road Pricing: Part I: A Parable and a Model
- Mathematical structure of a bilevel strategic pricing model
- Combinatorial behavior of extreme points of perturbed polyhedra
- NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
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)
