Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The speed of convergence in repeated games with incomplete information on one side.

From MaRDI portal
Publication:1972592
Jump to:navigation, search

DOI10.1007/S001820050077zbMath1058.91501OpenAlexW2054134237MaRDI QIDQ1972592

Jean-Francois Mertens

Publication date: 11 April 2000

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001820050077




Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)


Related Items (4)

How fast do equilibrium payoff sets converge in repeated games? ⋮ Belief-free equilibria in games with incomplete information: characterization and existence ⋮ Repeated Games with Incomplete Information ⋮ On the value of repetition for communication games







This page was built for publication: The speed of convergence in repeated games with incomplete information on one side.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1972592&oldid=14423629"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 16:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki