Reaching Your Goal Optimally by Playing at Random with No Memory

DOI10.4230/LIPICS.CONCUR.2020.26MaRDI QIDQ5089292zbMATH OpenOpenAlexFDO

Authors Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier

Publication date 18 July 2022

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

zbMATH Keywords

algorithmic game theoryrandomisationweighted games

Mathematics Subject Classification ID

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

Cites work

• An Analysis of Stochastic Shortest Path Problems
• Formal Methods for Components and Objects
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
• Trading Infinite Memory for Uniform Randomness in Timed Games

Cited in

(5)

• CONCUR 2005 – Concurrency Theory
• Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
• Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
• Playing stochastically in weighted timed games to emulate memory
• Playing stochastically in weighted timed games to emulate memory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089292)