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 条
  • [41] Social Context Congestion Games
    Bilo, Vittorio
    Celi, Alessandro
    Flammini, Michele
    Gallotti, Vasco
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, 2011, 6796 : 282 - 293
  • [42] Informational Incentives for Congestion Games
    Tavafoghi, Hamidreza
    Teneketzis, Demosthenis
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 1285 - 1292
  • [43] Congestion games with mixed objectives
    Feldotto, Matthias
    Leder, Lennart
    Skopalik, Alexander
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 36 (04) : 1145 - 1167
  • [44] Contention Issues in Congestion Games
    Koutsoupias, Elias
    Papakonstantinopoulou, Katia
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II, 2012, 7392 : 623 - 635
  • [45] Congestion Games with Malicious Players
    Babaioff, Moshe
    Kleinberg, Robert
    Papadimitriou, Christos H.
    EC'07: PROCEEDINGS OF THE EIGHTH ANNUAL CONFERENCE ON ELECTRONIC COMMERCE, 2007, : 103 - 112
  • [46] GAMES OF COORDINATION
    JURG, AP
    TIJS, SH
    RAVINDRAN, G
    LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1992, 389 : 225 - 242
  • [47] Malicious Bayesian Congestion Games
    Gairing, Martin
    APPROXIMATION AND ONLINE ALGORITHMS, 2009, 5426 : 119 - 132
  • [48] Mean field games with congestion
    Achdou, Yves
    Porretta, Alessio
    ANNALES DE L INSTITUT HENRI POINCARE-ANALYSE NON LINEAIRE, 2018, 35 (02): : 443 - 480
  • [49] Altruism in Atomic Congestion Games
    Hoefer, Martin
    Skopalik, Alexander
    ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 179 - 189
  • [50] On lookahead equilibria in congestion games
    Bilo, Vittorio
    Fanelli, Angelo
    Moscardelli, Luca
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2017, 27 (02) : 197 - 214