Reaching Your Goal Optimally by Playing at Random with No Memory

DOI10.4230/LIPIcs.CONCUR.2020.26OpenAlexW3082547220MaRDI QIDQ5089292

Pierre-Alain Reynier, Julie Parreaux, Benjamin Monmege

Publication date: 18 July 2022

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

zbMATH Keywords

weighted gamesalgorithmic game theoryrandomisation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
• Trading Infinite Memory for Uniform Randomness in Timed Games
• An Analysis of Stochastic Shortest Path Problems
• Formal Methods for Components and Objects

This page was built for publication: Reaching Your Goal Optimally by Playing at Random with No Memory