Formal methods for aN Iterated volunteer's dilemma

08/28/2020
by   Jacob Dineen, et al.
0

Game theory provides a paradigm through which we can study the evolving communication and phenomena that occur via rational agent interaction. In this work, we design a model framework and explore The Volunteer's Dilemma with the goals of 1) modeling it as a stochastic concurrent multiplayer game, 2) constructing properties to verify model correctness and reachability, 3) constructing strategy synthesis graphs to understand how the game is iteratively stepped through most optimally and, 4) analyzing a series of parameters to understand correlations with expected local and global rewards over a finite time horizon.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2017

The Complexity of Concurrent Rational Synthesis

In this paper, we investigate the rational synthesis problem for concurr...
research
07/08/2021

From local to global determinacy in concurrent graph games

In general, finite concurrent two-player reachability games are only det...
research
06/11/2018

Reachability for Branching Concurrent Stochastic Games

We give polynomial time algorithms for deciding almost-sure and limit-su...
research
07/30/2020

Dynamic Hypergames for Synthesis of Deceptive Strategies with Temporal Logic Objectives

In this paper, we study the use of deception for strategic planning in a...
research
10/27/2021

Optimal strategies in concurrent reachability games

We study two-player reachability games on finite graphs. At each state t...
research
08/04/2019

Automatic Playtesting for Game Parameter Tuning via Active Learning

Game designers use human playtesting to gather feedback about game desig...
research
03/13/2013

The Bounded Bayesian

The ideal Bayesian agent reasons from a global probability model, but re...

Please sign up or login with your details

Forgot password? Click here to reset