Randomized strategies in concurrent games

Abstract : We study games played on graphs by an arbitrary number of players withnon-zero sum objectives. The players representagents (programs, processes or devices) that can interact to achieve their ownobjectives as much as possible. Solution concepts, as Nash Equilibrium, forsuch optimal plays,need not exist when restricting topure deterministic strategies, even with simple reachability or safetyobjectives. The symmetry induced by deterministic behavioursmotivates the studies where eitherthe players or the environment can use randomization. In the first case, weshow that classical concepts are undecidable with a fixednumber of agents and propose computable approximations.In the second case, we studyrandomization as a reasonable policy for scheduling an arbitrary number ofprocesses.
Complete list of metadatas

Cited literature [77 references]  Display  Hide  Download

Contributor : Abes Star <>
Submitted on : Saturday, May 6, 2017 - 9:02:23 PM
Last modification on : Thursday, September 12, 2019 - 3:30:38 AM
Long-term archiving on : Monday, August 7, 2017 - 1:14:06 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01519354, version 1


Daniel Stan. Randomized strategies in concurrent games. Computer Science and Game Theory [cs.GT]. Université Paris-Saclay, 2017. English. ⟨NNT : 2017SACLN011⟩. ⟨tel-01519354⟩



Record views


Files downloads