Random Perfect Information Games

From MaRDI portal
Revision as of 08:12, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6199268

DOI10.1287/MOOR.2022.1277arXiv2104.10528OpenAlexW3155660102MaRDI QIDQ6199268

Janos Flesch, Arkadi Predtetchinski, Ville Suomala

Publication date: 23 February 2024

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Abstract: The paper proposes a natural measure space of zero-sum perfect information games with upper semicontinuous payoffs. Each game is specified by the game tree, and by the assignment of the active player and of the capacity to each node of the tree. The payoff in a game is defined as the infimum of the capacity over the nodes that have been visited during the play. The active player, the number of children, and the capacity are drawn from a given joint distribution independently across the nodes. We characterize the cumulative distribution function of the value $v$ using the fixed points of the so-called value generating function. The characterization leads to a necessary and sufficient condition for the event $v geq k$ to occur with positive probability. We also study probabilistic properties of the set of Player I's $k$-optimal strategies and the corresponding plays.


Full work available at URL: https://arxiv.org/abs/2104.10528










This page was built for publication: Random Perfect Information Games