A non-iterative algorithm for generalized pig games

DOI10.3934/jdg.2018020zbMath1422.91084arXiv1808.06707OpenAlexW2888104127MaRDI QIDQ2319668

Fabián Crocce, Ernesto Mordecki

Publication date: 20 August 2019

Published in: Journal of Dynamics and Games (Search for Journal in Brave)

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

zbMATH Keywords

polynomial algorithmsimple stochastic gamesdice games

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Stochastic games, stochastic differential games (91A15) Probabilistic games; gambling (91A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On strategy improvement algorithms for simple stochastic games
• The complexity of stochastic games
• A finite algorithm for the switching control stochastic game
• A subexponential bound for linear programming
• Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
• Optimal strategy in a dice game
• Solving Simple Stochastic Games with Few Coin Toss Positions
• A REAL-WORLD STOCHASTIC TWO-PERSON GAME
• Optimal Stopping in a Dice Game
• Recent studies on the Dice Race Problem and its connections
• Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
• Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games
• Simple Stochastic Games with Few Random Vertices Are Easy to Solve
• On Nonterminating Stochastic Games
• Stochastic Games with Perfect Information and Time Average Payoff
• Stochastic Games