Exact Algorithms for Solving Stochastic Games

Kristoffer Arnsfelt Hansen; Michal Koucky; Niels Lauritzen; Peter Bro Miltersen; Elias Tsigaridas

Exact Algorithms for Solving Stochastic Games

Kristoffer Arnsfelt Hansen, Michal Koucky, Niels Lauritzen, Peter Bro Miltersen, Elias Tsigaridas

Publikation: Working paper/Preprint › Working paper › Forskning

Abstract

Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.

Originalsprog	Engelsk
Antal sider	34
Status	Udgivet - 2012

Adgang til dokumentet

http://arxiv.org/abs/1202.3898

Citationsformater

@techreport{331d4355a38b4c939609ec918e7e6da9,

title = "Exact Algorithms for Solving Stochastic Games",

abstract = "Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.",

keywords = "protocols, authentication, secure computation",

author = "Hansen, {Kristoffer Arnsfelt} and Michal Koucky and Niels Lauritzen and Miltersen, {Peter Bro} and Elias Tsigaridas",

year = "2012",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - Exact Algorithms for Solving Stochastic Games

AU - Hansen, Kristoffer Arnsfelt

AU - Koucky, Michal

AU - Lauritzen, Niels

AU - Miltersen, Peter Bro

AU - Tsigaridas, Elias

PY - 2012

Y1 - 2012

N2 - Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.

AB - Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.

KW - protocols

KW - authentication

KW - secure computation

M3 - Working paper

BT - Exact Algorithms for Solving Stochastic Games

ER -

Exact Algorithms for Solving Stochastic Games

Abstract

Adgang til dokumentet

Fingeraftryk

Citationsformater