Loading…

Zero-sum repeated games: counterexamples to the existence of the asymptotic value and the conjecture maxmin=lim v(n)

We provide an example of a two-player zero-sum repeated game with public signals and perfect observation of the actions, where neither the value of the lambda-discounted game nor the value of the n-stage game converges, when respectively lambda goes to 0 and n goes to infinity. It is a counterexampl...

Full description

Saved in:
Bibliographic Details
Published in:The Annals of probability 2016-03
Main Author: Ziliotto, Bruno
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title The Annals of probability
container_volume
creator Ziliotto, Bruno
description We provide an example of a two-player zero-sum repeated game with public signals and perfect observation of the actions, where neither the value of the lambda-discounted game nor the value of the n-stage game converges, when respectively lambda goes to 0 and n goes to infinity. It is a counterexample to two long-standing conjectures, formulated by Mertens: first, in any zero-sum repeated game, the asymptotic value exists, and secondly, when Player 1 is more informed than Player 2, Player 1 is able to guarantee the limit value of the n-stage game in the long run. The aforementioned example involves seven states, two actions and two signals for each player. Remarkably, players observe the payoffs, and play in turn (at each step the action of one player only has an effect on the payoff and the transition). Moreover, it can be adapted to fit in the class of standard stochastic games where the state is not observed.
doi_str_mv 10.1214/14-AOP997
format article
fullrecord <record><control><sourceid>hal</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00824039v2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_00824039v2</sourcerecordid><originalsourceid>FETCH-LOGICAL-h119t-e834d2d2bbef58089f7eca8be83d846143f5c688814acce45d087385b26aee593</originalsourceid><addsrcrecordid>eNotzM9LwzAYxvEgCs7pwf8gR3eIJmnavhE8jKFOGMyDgngpafrWdTRNadKx_ffOH6cHPg98CbkW_FZIoe6EYvP1q9b5CZlIkQEDrT5OyYRzLZjINZyTixC2nPMsz9WExE8cPAujowP2aCJW9Ms4DPfU-rGLOODeuL7FQKOncYMU902I2Fmkvv4FEw6ujz42lu5MOx6hq34P67st2jgOSJ3Zu6Z7aBtHdzfd7JKc1aYNePW_U_L-9Pi2WLLV-vllMV-xjRA6MoREVbKSZYl1Chx0naM1UB69ApUJldSpzQBAKGMtqrTikCeQljIziKlOpmT2192YtuiHxpnhUHjTFMv5qvgxzkEqnuidTL4BG01fvA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Zero-sum repeated games: counterexamples to the existence of the asymptotic value and the conjecture maxmin=lim v(n)</title><source>JSTOR Archival Journals and Primary Sources Collection</source><creator>Ziliotto, Bruno</creator><creatorcontrib>Ziliotto, Bruno</creatorcontrib><description>We provide an example of a two-player zero-sum repeated game with public signals and perfect observation of the actions, where neither the value of the lambda-discounted game nor the value of the n-stage game converges, when respectively lambda goes to 0 and n goes to infinity. It is a counterexample to two long-standing conjectures, formulated by Mertens: first, in any zero-sum repeated game, the asymptotic value exists, and secondly, when Player 1 is more informed than Player 2, Player 1 is able to guarantee the limit value of the n-stage game in the long run. The aforementioned example involves seven states, two actions and two signals for each player. Remarkably, players observe the payoffs, and play in turn (at each step the action of one player only has an effect on the payoff and the transition). Moreover, it can be adapted to fit in the class of standard stochastic games where the state is not observed.</description><identifier>ISSN: 0091-1798</identifier><identifier>EISSN: 2168-894X</identifier><identifier>DOI: 10.1214/14-AOP997</identifier><language>eng</language><publisher>Institute of Mathematical Statistics</publisher><subject>Mathematics ; Optimization and Control ; Probability</subject><ispartof>The Annals of probability, 2016-03</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0002-4448-1411</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,27924,27925</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00824039$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Ziliotto, Bruno</creatorcontrib><title>Zero-sum repeated games: counterexamples to the existence of the asymptotic value and the conjecture maxmin=lim v(n)</title><title>The Annals of probability</title><description>We provide an example of a two-player zero-sum repeated game with public signals and perfect observation of the actions, where neither the value of the lambda-discounted game nor the value of the n-stage game converges, when respectively lambda goes to 0 and n goes to infinity. It is a counterexample to two long-standing conjectures, formulated by Mertens: first, in any zero-sum repeated game, the asymptotic value exists, and secondly, when Player 1 is more informed than Player 2, Player 1 is able to guarantee the limit value of the n-stage game in the long run. The aforementioned example involves seven states, two actions and two signals for each player. Remarkably, players observe the payoffs, and play in turn (at each step the action of one player only has an effect on the payoff and the transition). Moreover, it can be adapted to fit in the class of standard stochastic games where the state is not observed.</description><subject>Mathematics</subject><subject>Optimization and Control</subject><subject>Probability</subject><issn>0091-1798</issn><issn>2168-894X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNotzM9LwzAYxvEgCs7pwf8gR3eIJmnavhE8jKFOGMyDgngpafrWdTRNadKx_ffOH6cHPg98CbkW_FZIoe6EYvP1q9b5CZlIkQEDrT5OyYRzLZjINZyTixC2nPMsz9WExE8cPAujowP2aCJW9Ms4DPfU-rGLOODeuL7FQKOncYMU902I2Fmkvv4FEw6ujz42lu5MOx6hq34P67st2jgOSJ3Zu6Z7aBtHdzfd7JKc1aYNePW_U_L-9Pi2WLLV-vllMV-xjRA6MoREVbKSZYl1Chx0naM1UB69ApUJldSpzQBAKGMtqrTikCeQljIziKlOpmT2192YtuiHxpnhUHjTFMv5qvgxzkEqnuidTL4BG01fvA</recordid><startdate>20160301</startdate><enddate>20160301</enddate><creator>Ziliotto, Bruno</creator><general>Institute of Mathematical Statistics</general><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-4448-1411</orcidid></search><sort><creationdate>20160301</creationdate><title>Zero-sum repeated games: counterexamples to the existence of the asymptotic value and the conjecture maxmin=lim v(n)</title><author>Ziliotto, Bruno</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h119t-e834d2d2bbef58089f7eca8be83d846143f5c688814acce45d087385b26aee593</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Mathematics</topic><topic>Optimization and Control</topic><topic>Probability</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ziliotto, Bruno</creatorcontrib><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>The Annals of probability</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ziliotto, Bruno</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Zero-sum repeated games: counterexamples to the existence of the asymptotic value and the conjecture maxmin=lim v(n)</atitle><jtitle>The Annals of probability</jtitle><date>2016-03-01</date><risdate>2016</risdate><issn>0091-1798</issn><eissn>2168-894X</eissn><abstract>We provide an example of a two-player zero-sum repeated game with public signals and perfect observation of the actions, where neither the value of the lambda-discounted game nor the value of the n-stage game converges, when respectively lambda goes to 0 and n goes to infinity. It is a counterexample to two long-standing conjectures, formulated by Mertens: first, in any zero-sum repeated game, the asymptotic value exists, and secondly, when Player 1 is more informed than Player 2, Player 1 is able to guarantee the limit value of the n-stage game in the long run. The aforementioned example involves seven states, two actions and two signals for each player. Remarkably, players observe the payoffs, and play in turn (at each step the action of one player only has an effect on the payoff and the transition). Moreover, it can be adapted to fit in the class of standard stochastic games where the state is not observed.</abstract><pub>Institute of Mathematical Statistics</pub><doi>10.1214/14-AOP997</doi><orcidid>https://orcid.org/0000-0002-4448-1411</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0091-1798
ispartof The Annals of probability, 2016-03
issn 0091-1798
2168-894X
language eng
recordid cdi_hal_primary_oai_HAL_hal_00824039v2
source JSTOR Archival Journals and Primary Sources Collection
subjects Mathematics
Optimization and Control
Probability
title Zero-sum repeated games: counterexamples to the existence of the asymptotic value and the conjecture maxmin=lim v(n)
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T18%3A01%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Zero-sum%20repeated%20games:%20counterexamples%20to%20the%20existence%20of%20the%20asymptotic%20value%20and%20the%20conjecture%20maxmin=lim%20v(n)&rft.jtitle=The%20Annals%20of%20probability&rft.au=Ziliotto,%20Bruno&rft.date=2016-03-01&rft.issn=0091-1798&rft.eissn=2168-894X&rft_id=info:doi/10.1214/14-AOP997&rft_dat=%3Chal%3Eoai_HAL_hal_00824039v2%3C/hal%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-h119t-e834d2d2bbef58089f7eca8be83d846143f5c688814acce45d087385b26aee593%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true