Asynchrony (game theory)

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.

gollark: ++delete <@738361430763372703>
gollark: https://math.stackexchange.com/questions/216336/property-of-sum-sum-k-1-infty-frac2k14n11-exp2k1-pi
gollark: There does not seem to be any "simple" way.
gollark: I found someone else talking about it so now I have ATTAINED the INFORMATION.
gollark: Implement hypermetatrait subclasses.

References

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


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.