Show simple item record

dc.contributor.authorOliu Barton, Miquel
dc.date.accessioned2020-05-13T08:53:05Z
dc.date.available2020-05-13T08:53:05Z
dc.date.issued2020
dc.identifier.issn0364-765X
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/20725
dc.descriptionPublished Online: 28 May 2020. https://doi.org/10.1287/moor.2020.1055
dc.language.isoenen
dc.subjectzero-sum stochastic games
dc.subjectgame theory
dc.subject.ddc515en
dc.titleNew algorithms for solving zero-sum stochastic games
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenZero-sum stochastic games, henceforth stochastic games, are a classical model in game theory in which two opponents interact and the environment changes in response to the players’ behavior. The central solution concepts for these games are the discounted values and the value, which represent what playing the game is worth to the players for different levels of impatience. In the present manuscript, we provide algorithms for computing exact expressions for the discounted values and for the value, which are polynomial in the number of pure stationary strategies of the players. This result considerably improves all the existing algorithms, including the most efficient one, due to Hansen, Koucký, Lauritzen, Miltersen and Tsigaridas (STOC 2011).
dc.relation.isversionofjnlnameMathematics of Operations Research
dc.relation.isversionofjnldate2020
dc.identifier.urlsitehttps://pubsonline.informs.org/doi/10.1287/moor.2020.1055
dc.relation.isversionofjnlpublisherINFORMS
dc.subject.ddclabelAnalyseen
dc.relation.forthcomingouien
dc.relation.forthcomingprintouien
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewedoui
dc.date.updated2020-05-30T08:53:42Z
hal.faultCodeInternal server error: Test collection CEREMADE-DAUPHINE not found


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record