Abstract
A simplified model of multistage bidding between two differently informed agents (insider and uninformed participant) is described using repeated games with asymmetric information. The solutions for these games are obtained in the explicit form for the case of three possible bids. The game value (the maximal guaranteed insider’s payoff) and the optimal players’ strategies are expressed using a second-order recursive sequence.
Similar content being viewed by others
References
L. Bachelier, “Theorie de speculation”, Ann. Ecole Norm. Sup., 17, 21–86 (1900).
B. De Meyer and H. Sale, “On the Strategic Origin of Brownian Motion in Finance”, Int. J. Game Theory, 31, 285–319 (2002).
R. Aumann and M. Maschler, Repeated Games with Incomplete Information (The MIT Press, Cambridge, Massachusetts — London, 1995).
V. K. Domanskii and V. L. Kreps, “Time Instant of Detection of “Insider” Information on Auction with Asymmetric Information of Agents”, Obzor. Prikl. Promyshl. Matem., 14(3), 399–416 (2007).
V. Domansky, “Repeated Games with Asymmetric Information and Random Price Fluctuations at Finance Markets”, Int. J. of Game Theory, 36(2). 241–257 (2007).
N. N. Vorob’ev, Fibonacci Numbers (Nauka, Moscow, 1969) [in Russian].
Author information
Authors and Affiliations
Additional information
Original Russian Text © V.L. Kreps, 2009, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2009, No. 4, pp. 109–120.
Rights and permissions
About this article
Cite this article
Kreps, V.L. Repeated games simulating exchange auction and recursive sequences. J. Comput. Syst. Sci. Int. 48, 604–615 (2009). https://doi.org/10.1134/S1064230709040145
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230709040145