Infinitely repeated quantum games and strategic efficiency
Abstract
References
Index Terms
- Infinitely repeated quantum games and strategic efficiency
Recommendations
The complexity of infinitely repeated alternating move games
ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part IWe consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour [10]. They presented an FPTAS for computing an approximate equilibrium, and conjectured that there is a polynomial algorithm for ...
Quantum repeated pricing game
AbstractWe study a twice-repeated pricing game in the quantum domain. Two firms play this game, and both firms have three pricing strategies. The classical version of the repeated game has multiple Nash equilibria in every stage. We prove that the ...
Fast equilibrium computation for infinitely repeated games
AAAI'13: Proceedings of the Twenty-Seventh AAAI Conference on Artificial IntelligenceIt is known that an equilibrium of an infinitely repeated two-player game (with limit average payoffs) can be computed in polynomial time, as follows: according to the folk theorem, we compute minimax strategies for both players to calculate the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Kluwer Academic Publishers
United States
Publication History
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in