Asymptotically optimal strategies in repeated games with incomplete information

DOI10.1007/BF01271132MaRDI QIDQ1189669zbMATH OpenOpenAlexFDO

Authors S. Singh

Publication date 27 September 1992

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

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

zbMATH Keywords

incomplete informationrepeated zero-sum games\(N\)-stage game

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15) Multistage and repeated games (91A20)

Recommendations

• Asymptotically optimal strategies in repeated games with incomplete information and vanishing weights
• The speed of convergence in repeated games with incomplete information on one side.
• On repeated games without a recursive structure: Existence of \(\lim v_ n\)
• ``Big match with lack of information on one side. II
• Zero Sum Absorbing Games with Incomplete Information on One Side: Asymptotic Analysis

Cites work

• A duality theorem on a pair of simultaneous functional equations
• An analog of the minimax theorem for vector payoffs
• Convex Analysis
• Minmax and maxmin of repeated games with incomplete information
• On a pair of simultaneous functional equations
• The value of two-person zero-sum repeated games with lack of information on both sides

Cited in

(21)

• The splitting game: value and optimal strategies
• Zero Sum Absorbing Games with Incomplete Information on One Side: Asymptotic Analysis
• The value of Markov chain games with incomplete information on both sides
• On repeated zero-sum games with incomplete information and asymptotically bounded values
• Zero-sum stopping games with asymmetric information
• Long information design
• Existence of value for differential games with incomplete information and signals on initial states and payoffs
• Repeated Games with Incomplete Information over Predictable Systems
• Repeated games of incomplete information with large sets of states
• Asymptotically Efficient Adaptive Strategies in Repeated Games Part I: Certainty Equivalence Strategies
• Asymptotically Efficient Adaptive Strategies in Repeated Games Part II. Asymptotic Optimality
• Repeated bidding games with incomplete information and bounded values: on the exponential speed of convergence
• Dynamical analysis of a repeated game with incomplete information
• Splitting games over finite sets
• Some Asymptotic Results in Discounted Repeated Games of One-Sided Incomplete Information
• Differential games with asymmetric and correlated information
• scientific article; zbMATH DE number 3915325 (Why is no real title available?)
• Asymptotically optimal strategies in repeated games with incomplete information and vanishing weights
• Finite approximation to a zero-sum game with incomplete information
• On repeated games without a recursive structure: Existence of \(\lim v_ n\)
• Optimal strategies in zero-sum repeated games with incomplete information: the dependent case

This page was built for publication: Asymptotically optimal strategies in repeated games with incomplete information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189669)