Year: 2018
Type: preprint
Abstract: We provide a polynomial algorithm to find the value and an optimal strategy for a generalization of the Pig game. Modeled as a competitive Markov decision process, the corresponding Bellman equations can be decoupled leading to systems of two non-linear equations with two unknowns. In this way we avoid the classical iterative approaches. A simple complexity analysis reveals that the algorithm requires O(s log(s)) steps, where s is the number of states of the game. The classical Pig and the Piglet (a simple variant of the Pig played with a coin) are examined in detail.
Source: arXiv (Cornell University)
Authors: Crocce, Fabián, Mordecki, Ernesto
Institution: Universidad de la República de Uruguay
Language: English
Topic: Game Theory and Applications
Field: Decision Sciences
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W2951324615