Jump to content

Asynchrony (game theory)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Bender235 (talk | contribs) at 19:21, 29 May 2020 (→‎top: Replaced arXiv PDF link with more mobile-friendly abstract link, replaced: https://arxiv.org/pdf/ → https://arxiv.org/abs/). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In game theory, asynchrony 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 other."[1]

Abraham, I., Alvisi, L., & Halpern, J. Y. (2011). Distributed computing meets game theory: combining insights from two fields. Acm Sigact News, 42(2), 69-76.

Ben-Or, M. (1983). Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In Proc. 2nd ACM Symp. on Principles of Distributed Computing, pp. 27–30.

References

  1. ^ Halpern, J. Y. (2003). A computer scientist looks at game theory. Games and Economic Behavior, 45(1), p. 120