Emergent coordination in temporal partitioning congestion games

被引:0
|
作者
Cohen, Reuven [1 ]
Perez, Oren [2 ]
机构
[1] Bar Ilan Univ, Dept Math, Ramat Gan, Israel
[2] Bar Ilan Univ, Fac Law, Multidisciplinary Sch Environm & Sustainabil, Ramat Gan, Israel
来源
PLOS ONE | 2024年 / 19卷 / 08期
关键词
IRIS-ATROPURPUREA; DISAPPOINTMENT;
D O I
10.1371/journal.pone.0308341
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
In this article we study the social dynamic of temporal partitioning congestion games (TPGs), in which participants must coordinate an optimal time-partitioning for using a limited resource. The challenge in TPGs lies in determining whether users can optimally self-organize their usage patterns. Reaching an optimal solution may be undermined, however, by a collectively destructive meta-reasoning pattern, trapping users in a socially vicious oscillatory behavior. TPGs constitute a dilemma for both human and animal communities. We developed a model capturing the dynamics of these games and ran simulations to assess its behavior, based on a 2x2 framework that distinguishes between the players' knowledge of other players' choices and whether they use a learning mechanism. We found that the only way in which an oscillatory dynamic can be thwarted is by adding learning, which leads to weak convergence in the no-information condition and to strong convergence in the with-information condition. We corroborated the validity of our model using real data from a study of bats' behaviour in an environment of water scarcity. We conclude by examining the merits of a complexity-based, agent-based modelling approach over a game-theoretic one, contending that it offers superior insights into the temporal dynamics of TPGs. We also briefly discuss the policy implications of our findings.
引用
收藏
页数:17
相关论文
共 50 条
  • [31] On the inefficiency of equilibria in congestion games
    Correa, JR
    Schulz, AS
    Stier-Moses, NE
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2005, 3509 : 167 - 181
  • [32] Transfer Implementation in Congestion Games
    Itai Arieli
    Dynamic Games and Applications, 2015, 5 : 228 - 238
  • [33] Welfare maximization in congestion games
    Blumrosen, Liad
    Dobzinski, Shahar
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2007, 25 (06) : 1224 - 1236
  • [34] Strong equilibrium in congestion games
    Holzman, R
    LawYone, N
    GAMES AND ECONOMIC BEHAVIOR, 1997, 21 (1-2) : 85 - 101
  • [35] Random Order Congestion Games
    Penn, Michal
    Polukarov, Maria
    Tennenholtz, Moshe
    MATHEMATICS OF OPERATIONS RESEARCH, 2009, 34 (03) : 706 - 725
  • [36] Congestion Games with Variable Demands
    Harks, Tobias
    Klimm, Max
    MATHEMATICS OF OPERATIONS RESEARCH, 2016, 41 (01) : 255 - 277
  • [37] Congestion Games with Capacitated Resources
    Laurent Gourvès
    Jérôme Monnot
    Stefano Moretti
    Nguyen Kim Thang
    Theory of Computing Systems, 2015, 57 : 598 - 616
  • [38] Taxed congestion games with failures
    Penn, Michal
    Polukarov, Maria
    Tennenholtz, Moshe
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2009, 56 (02) : 133 - 151
  • [39] Congestion Games with Capacitated Resources
    Gourves, Laurent
    Monnot, Jerome
    Moretti, Stefano
    Nguyen Kim Thang
    THEORY OF COMPUTING SYSTEMS, 2015, 57 (03) : 598 - 616
  • [40] Heterogeneity and chaos in congestion games
    Naimzada, A. K.
    Raimondo, Roberto
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 335 : 278 - 291