Knowledge

Asynchrony (game theory)

Source đź“ť

1186: 24:
occurs when gameplay does not proceed in consistently paced rounds. A system is synchronous if agents in a game move in lockstep according to a global timing system, whereas "in an asynchronous system, there is no global clock. The agents in the system can run at arbitrary rates relative to each
56:
Solodkin, L., & Oshman, R. (2021). Truthful Information Dissemination in General Asynchronous Networks. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum fĂĽr Informatik.
1227: 124: 65:
Yifrach, A., & Mansour, Y. (2018, July). Fair leader election for rational agents in asynchronous rings and networks. In
1023: 840: 375: 173: 659: 478: 1256: 280: 58: 749: 619: 290: 458: 1251: 1220: 800: 218: 193: 1150: 576: 330: 320: 255: 370: 350: 1084: 835: 805: 463: 305: 300: 1120: 1043: 779: 335: 260: 117: 35: 1213: 1135: 868: 754: 551: 345: 163: 1201: 938: 1140: 739: 709: 365: 153: 1165: 1145: 1125: 1074: 744: 649: 508: 453: 385: 355: 275: 203: 624: 609: 183: 44: 1246: 958: 943: 830: 825: 729: 714: 679: 644: 243: 188: 110: 8: 1115: 734: 684: 521: 448: 428: 285: 168: 774: 1094: 953: 784: 764: 614: 493: 398: 325: 270: 1079: 1048: 1003: 898: 769: 724: 699: 629: 503: 433: 423: 315: 265: 213: 1160: 1155: 1089: 1053: 1033: 993: 963: 918: 873: 858: 815: 669: 310: 247: 233: 198: 1058: 1018: 973: 888: 883: 604: 556: 443: 208: 178: 148: 1185: 923: 1197: 998: 988: 978: 913: 903: 893: 878: 674: 654: 639: 634: 594: 561: 546: 541: 531: 340: 59:
https://drops.dagstuhl.de/opus/volltexte/2021/14839/pdf/LIPIcs-DISC-2021-37.pdf
1240: 1038: 1028: 983: 968: 948: 719: 694: 566: 536: 526: 513: 418: 360: 295: 228: 45:
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols
67:
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
36:
Distributed computing meets game theory: combining insights from two fields.
1013: 1008: 863: 438: 1193: 1130: 933: 928: 908: 704: 689: 498: 468: 403: 393: 223: 158: 134: 17: 102: 759: 413: 70: 664: 584: 408: 1099: 599: 90: 820: 810: 488: 589: 49:
Proc. 2nd ACM Symp. on Principles of Distributed Computing
34:
Abraham, I., Alvisi, L., & Halpern, J. Y. (2011).
1238: 1221: 118: 1228: 1214: 125: 111: 91:A computer scientist looks at game theory. 132: 1239: 106: 1180: 71:https://arxiv.org/pdf/1805.04778.pdf 13: 174:First-player and second-player win 14: 1268: 28: 1184: 281:Coalition-proof Nash equilibrium 291:Evolutionarily stable strategy 83: 38:Acm Sigact News, 42(2), 69–76. 1: 219:Simultaneous action selection 76: 1200:. You can help Knowledge by 1151:List of games in game theory 331:Quantal response equilibrium 321:Perfect Bayesian equilibrium 256:Bayes correlated equilibrium 7: 620:Optional prisoner's dilemma 351:Self-confirming equilibrium 94:Games and Economic Behavior 10: 1273: 1179: 1085:Principal variation search 801:Aumann's agreement theorem 464:Strategy-stealing argument 376:Trembling hand equilibrium 306:Markov perfect equilibrium 301:Mertens-stable equilibrium 1121:Combinatorial game theory 1108: 1067: 849: 793: 780:Princess and monster game 575: 477: 384: 336:Quasi-perfect equilibrium 261:Bayesian Nash equilibrium 242: 141: 1136:Evolutionary game theory 869:Antoine Augustin Cournot 755:Guess 2/3 of the average 552:Strictly determined game 346:Satisfaction equilibrium 164:Escalation of commitment 1257:Economic theories stubs 1141:Glossary of game theory 740:Stackelberg competition 366:Strong Nash equilibrium 89:Halpern, J. Y. (2003). 1166:Tragedy of the commons 1146:List of game theorists 1126:Confrontation analysis 836:Sprague–Grundy theorem 356:Sequential equilibrium 276:Correlated equilibrium 939:Jean-François Mertens 1252:Microeconomics stubs 1068:Search optimizations 944:Jennifer Tour Chayes 831:Revelation principle 826:Purification theorem 765:Nash bargaining game 730:Bertrand competition 715:El Farol Bar problem 680:Electronic mail game 645:Lewis signaling game 189:Hierarchy of beliefs 1116:Bounded rationality 735:Cournot competition 685:Rock paper scissors 660:Battle of the sexes 650:Volunteer's dilemma 522:Perfect information 449:Dominant strategies 286:Epsilon-equilibrium 169:Extensive-form game 43:Ben-Or, M. (1983). 1095:Paranoid algorithm 1075:Alpha–beta pruning 954:John Maynard Smith 785:Rendezvous problem 625:Traveler's dilemma 615:Gift-exchange game 610:Prisoner's dilemma 527:Large Poisson game 494:Bargaining problem 399:Backward induction 371:Subgame perfection 326:Proper equilibrium 1209: 1208: 1174: 1173: 1080:Aspiration window 1049:Suzanne Scotchmer 1004:Oskar Morgenstern 899:Donald B. Gillies 841:Zermelo's theorem 770:Induction puzzles 725:Fair cake-cutting 700:Public goods game 630:Coordination game 504:Intransitive game 434:Forward induction 316:Pareto efficiency 296:Gibbs equilibrium 266:Berge equilibrium 214:Simultaneous game 51:, pp. 27–30. 1264: 1230: 1223: 1216: 1188: 1181: 1161:Topological game 1156:No-win situation 1054:Thomas Schelling 1034:Robert B. Wilson 994:Merrill M. Flood 964:John von Neumann 874:Ariel Rubinstein 859:Albert W. Tucker 710:War of attrition 670:Matching pennies 311:Nash equilibrium 234:Mechanism design 199:Normal-form game 154:Cooperative game 127: 120: 113: 104: 103: 97: 87: 1272: 1271: 1267: 1266: 1265: 1263: 1262: 1261: 1237: 1236: 1235: 1234: 1177: 1175: 1170: 1104: 1090:max^n algorithm 1063: 1059:William Vickrey 1019:Reinhard Selten 974:Kenneth Binmore 889:David K. Levine 884:Daniel Kahneman 851: 845: 821:Negamax theorem 811:Minimax theorem 789: 750:Diner's dilemma 605:All-pay auction 571: 557:Stochastic game 509:Mean-field game 480: 473: 444:Markov strategy 380: 246: 238: 209:Sequential game 194:Information set 179:Game complexity 149:Congestion game 137: 131: 101: 100: 96:, 45(1), p. 120 88: 84: 79: 69:(pp. 217-226). 31: 12: 11: 5: 1270: 1260: 1259: 1254: 1249: 1233: 1232: 1225: 1218: 1210: 1207: 1206: 1189: 1172: 1171: 1169: 1168: 1163: 1158: 1153: 1148: 1143: 1138: 1133: 1128: 1123: 1118: 1112: 1110: 1106: 1105: 1103: 1102: 1097: 1092: 1087: 1082: 1077: 1071: 1069: 1065: 1064: 1062: 1061: 1056: 1051: 1046: 1041: 1036: 1031: 1026: 1024:Robert Axelrod 1021: 1016: 1011: 1006: 1001: 999:Olga Bondareva 996: 991: 989:Melvin Dresher 986: 981: 979:Leonid Hurwicz 976: 971: 966: 961: 956: 951: 946: 941: 936: 931: 926: 921: 916: 914:Harold W. Kuhn 911: 906: 904:Drew Fudenberg 901: 896: 894:David M. Kreps 891: 886: 881: 879:Claude Shannon 876: 871: 866: 861: 855: 853: 847: 846: 844: 843: 838: 833: 828: 823: 818: 816:Nash's theorem 813: 808: 803: 797: 795: 791: 790: 788: 787: 782: 777: 772: 767: 762: 757: 752: 747: 742: 737: 732: 727: 722: 717: 712: 707: 702: 697: 692: 687: 682: 677: 675:Ultimatum game 672: 667: 662: 657: 655:Dollar auction 652: 647: 642: 640:Centipede game 637: 632: 627: 622: 617: 612: 607: 602: 597: 595:Infinite chess 592: 587: 581: 579: 573: 572: 570: 569: 564: 562:Symmetric game 559: 554: 549: 547:Signaling game 544: 542:Screening game 539: 534: 532:Potential game 529: 524: 519: 511: 506: 501: 496: 491: 485: 483: 475: 474: 472: 471: 466: 461: 459:Mixed strategy 456: 451: 446: 441: 436: 431: 426: 421: 416: 411: 406: 401: 396: 390: 388: 382: 381: 379: 378: 373: 368: 363: 358: 353: 348: 343: 341:Risk dominance 338: 333: 328: 323: 318: 313: 308: 303: 298: 293: 288: 283: 278: 273: 268: 263: 258: 252: 250: 240: 239: 237: 236: 231: 226: 221: 216: 211: 206: 201: 196: 191: 186: 184:Graphical game 181: 176: 171: 166: 161: 156: 151: 145: 143: 139: 138: 130: 129: 122: 115: 107: 99: 98: 81: 80: 78: 75: 74: 73: 62: 61: 53: 52: 40: 39: 30: 29:External links 27: 9: 6: 4: 3: 2: 1269: 1258: 1255: 1253: 1250: 1248: 1245: 1244: 1242: 1231: 1226: 1224: 1219: 1217: 1212: 1211: 1205: 1203: 1199: 1196:article is a 1195: 1190: 1187: 1183: 1182: 1178: 1167: 1164: 1162: 1159: 1157: 1154: 1152: 1149: 1147: 1144: 1142: 1139: 1137: 1134: 1132: 1129: 1127: 1124: 1122: 1119: 1117: 1114: 1113: 1111: 1109:Miscellaneous 1107: 1101: 1098: 1096: 1093: 1091: 1088: 1086: 1083: 1081: 1078: 1076: 1073: 1072: 1070: 1066: 1060: 1057: 1055: 1052: 1050: 1047: 1045: 1044:Samuel Bowles 1042: 1040: 1039:Roger Myerson 1037: 1035: 1032: 1030: 1029:Robert Aumann 1027: 1025: 1022: 1020: 1017: 1015: 1012: 1010: 1007: 1005: 1002: 1000: 997: 995: 992: 990: 987: 985: 984:Lloyd Shapley 982: 980: 977: 975: 972: 970: 969:Kenneth Arrow 967: 965: 962: 960: 957: 955: 952: 950: 949:John Harsanyi 947: 945: 942: 940: 937: 935: 932: 930: 927: 925: 922: 920: 919:Herbert Simon 917: 915: 912: 910: 907: 905: 902: 900: 897: 895: 892: 890: 887: 885: 882: 880: 877: 875: 872: 870: 867: 865: 862: 860: 857: 856: 854: 848: 842: 839: 837: 834: 832: 829: 827: 824: 822: 819: 817: 814: 812: 809: 807: 804: 802: 799: 798: 796: 792: 786: 783: 781: 778: 776: 773: 771: 768: 766: 763: 761: 758: 756: 753: 751: 748: 746: 743: 741: 738: 736: 733: 731: 728: 726: 723: 721: 720:Fair division 718: 716: 713: 711: 708: 706: 703: 701: 698: 696: 695:Dictator game 693: 691: 688: 686: 683: 681: 678: 676: 673: 671: 668: 666: 663: 661: 658: 656: 653: 651: 648: 646: 643: 641: 638: 636: 633: 631: 628: 626: 623: 621: 618: 616: 613: 611: 608: 606: 603: 601: 598: 596: 593: 591: 588: 586: 583: 582: 580: 578: 574: 568: 567:Zero-sum game 565: 563: 560: 558: 555: 553: 550: 548: 545: 543: 540: 538: 537:Repeated game 535: 533: 530: 528: 525: 523: 520: 518: 516: 512: 510: 507: 505: 502: 500: 497: 495: 492: 490: 487: 486: 484: 482: 476: 470: 467: 465: 462: 460: 457: 455: 454:Pure strategy 452: 450: 447: 445: 442: 440: 437: 435: 432: 430: 427: 425: 422: 420: 419:De-escalation 417: 415: 412: 410: 407: 405: 402: 400: 397: 395: 392: 391: 389: 387: 383: 377: 374: 372: 369: 367: 364: 362: 361:Shapley value 359: 357: 354: 352: 349: 347: 344: 342: 339: 337: 334: 332: 329: 327: 324: 322: 319: 317: 314: 312: 309: 307: 304: 302: 299: 297: 294: 292: 289: 287: 284: 282: 279: 277: 274: 272: 269: 267: 264: 262: 259: 257: 254: 253: 251: 249: 245: 241: 235: 232: 230: 229:Succinct game 227: 225: 222: 220: 217: 215: 212: 210: 207: 205: 202: 200: 197: 195: 192: 190: 187: 185: 182: 180: 177: 175: 172: 170: 167: 165: 162: 160: 157: 155: 152: 150: 147: 146: 144: 140: 136: 128: 123: 121: 116: 114: 109: 108: 105: 95: 92: 86: 82: 72: 68: 64: 63: 60: 55: 54: 50: 46: 42: 41: 37: 33: 32: 26: 23: 19: 1202:expanding it 1191: 1176: 1014:Peyton Young 1009:Paul Milgrom 924:HervĂ© Moulin 864:Amos Tversky 806:Folk theorem 517:-player game 514: 439:Grim trigger 93: 85: 66: 48: 21: 15: 1247:Game theory 1194:game theory 1131:Coopetition 934:Jean Tirole 929:John Conway 909:Eric Maskin 705:Blotto game 690:Pirate game 499:Global game 469:Tit for tat 404:Bid shading 394:Appeasement 244:Equilibrium 224:Solved game 159:Determinacy 142:Definitions 135:game theory 18:game theory 1241:Categories 775:Trust game 760:Kuhn poker 429:Escalation 424:Deterrence 414:Cheap talk 386:Strategies 204:Preference 133:Topics of 77:References 22:asynchrony 959:John Nash 665:Stag hunt 409:Collusion 1100:Lazy SMP 794:Theorems 745:Deadlock 600:Checkers 481:of games 248:concepts 25:other." 852:figures 635:Chicken 489:Auction 479:Classes 1192:This 590:Chess 577:Games 47:. In 1198:stub 271:Core 850:Key 16:In 1243:: 585:Go 20:, 1229:e 1222:t 1215:v 1204:. 515:n 126:e 119:t 112:v

Index

game theory
Distributed computing meets game theory: combining insights from two fields.
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols
https://drops.dagstuhl.de/opus/volltexte/2021/14839/pdf/LIPIcs-DISC-2021-37.pdf
https://arxiv.org/pdf/1805.04778.pdf
A computer scientist looks at game theory.
v
t
e
game theory
Congestion game
Cooperative game
Determinacy
Escalation of commitment
Extensive-form game
First-player and second-player win
Game complexity
Graphical game
Hierarchy of beliefs
Information set
Normal-form game
Preference
Sequential game
Simultaneous game
Simultaneous action selection
Solved game
Succinct game
Mechanism design
Equilibrium
concepts

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑