How Good Is a Strategy in a Game With Nature?

02/23/2020
by   Arnaud Carayol, et al.
0

We consider games with two antagonistic players —Éloïse (modelling a program) and Abélard (modelling a byzantine environment) — and a third, unpredictable and uncontrollable player, that we call Nature. Motivated by the fact that the usual probabilistic semantics very quickly leads to undecidability when considering either infinite game graphs or imperfect-information, we propose two alternative semantics that leads to decidability where the probabilistic one fails: one based on counting and one based on topology.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/09/2019

Bidding Mechanisms in Graph Games

In two-player games on graphs, the players move a token through a graph ...
07/21/2021

Finite-memory strategies in two-player infinite games

We study infinite two-player win/lose games (A,B,W) where A,B are finite...
06/17/2020

The No-Flippancy Game

We analyze a coin-based game with two players where, before starting the...
06/26/2018

Banach-Mazur Parity Games and Almost-sure Winning Strategies

Two-player stochastic games are games with two 2 players and a randomise...
08/11/2021

Linear Bounds for Cycle-free Saturation Games

Given a family of graphs ℱ, we define the ℱ-saturation game as follows. ...
09/07/2017

Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting

Probabilistic program analysis aims to quantify the probability that a g...
10/15/2019

Studying Topology of Time Lines Graph leads to an alternative approach to the Newcomb's Paradox

The Newcomb's paradox is one of the most known paradox in Game Theory ab...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.