Games and teams with shared constraints

被引:8
作者
Kulkarni, Ankur A. [1 ]
机构
[1] Indian Inst Technol, Syst & Control Engn, Bombay 400076, Maharashtra, India
来源
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES | 2017年 / 375卷 / 2100期
关键词
game theory; shared constraints; team theory; GENERALIZED NASH GAMES; VARIATIONAL-INEQUALITIES; EQUILIBRIUM;
D O I
10.1098/rsta.2016.0302
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Energy systems of the future are envisaged to encompass multiple interacting autonomous entities. The theory of games provides the foundations for the design and analysis of such systems. This paper reviews models and results that would be of use for such analysis. Classically, games have involved players whose strategies are coupled only through the dependence of utility functions on strategies of other players. However, in many practical settings in the energy domain, system-level limitations bind the choices players can make. In 1965, Rosen (Econometrica 33, 520-534 (doi: 10.2307/1911749)) pioneered the study of a class of games where there is a common constraint, called a shared constraint, that couples the strategies available to the players. We discuss how this seemingly benign extension has important ramifications, ranging from the very definition of an equilibrium concept, to other key issues such as existence, uniqueness and efficiency of equilibria. We show how the presence of a shared constraint naturally leads to notions of a price and forms the motivations for more recent models. Although most of the paper has the character of a survey, occasionally we also prove new results. This article is part of the themed issue 'Energy management: flexibility, risk and optimization'.
引用
收藏
页数:15
相关论文
共 50 条
[31]   A Distributed Algorithm For Almost-Nash Equilibria of Average Aggregative Games With Coupling Constraints [J].
Parise, Francesca ;
Gentile, Basilio ;
Lygeros, John .
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2020, 7 (02) :770-782
[32]   Tacit collusion games in pool-based electricity markets under transmission constraints [J].
Liu, Andrew L. ;
Hobbs, Benjamin F. .
MATHEMATICAL PROGRAMMING, 2013, 140 (02) :351-379
[33]   An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games [J].
Kulkarni, Ankur A. ;
Shanbhag, Uday V. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2015, 60 (12) :3379-3384
[34]   Economic foundations of generalized games with shared constraint: Do binding agreements lead to less Nash equilibria? [J].
Braouezec, Yann ;
Kiani, Keyvan .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (01) :467-479
[35]   A Unified Analysis of First-Order Methods for Smooth Games via Integral Quadratic Constraints [J].
Zhan, Guodong ;
Bao, Xuchan ;
Lessard, Laurent ;
Grosse, Roger .
JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
[36]   Transfer of conflict and cooperation from experienced games to new games: a connectionist model of learning [J].
Spiliopoulos, Leonidas .
FRONTIERS IN NEUROSCIENCE, 2015, 9
[37]   Minimax across a population of games [J].
Ido Erev ;
Alvin E. Roth ;
Robert Slonim .
Journal of the Economic Science Association, 2016, 2 (2) :144-156
[38]   The Loners Will Benefit from the Games [J].
Zhou, Ai-nong ;
Nie, Pu-yan ;
Zhang, Xiao-yan ;
Liu, Lou .
INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION TECHNOLOGY AND AUTOMATION, VOL 2, PROCEEDINGS, 2008, :781-783
[39]   Minimax across a population of games [J].
Erev, Ido ;
Roth, Alvin E. ;
Slonim, Robert .
JOURNAL OF THE ECONOMIC SCIENCE ASSOCIATION-JESA, 2016, 2 (02) :144-156
[40]   Dependence in games and dependence games [J].
Grossi, Davide ;
Turrini, Paolo .
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2012, 25 (02) :284-312