Aarhus Universitets segl

Exact Algorithms for Solving Stochastic Games

Publikation: Working paper/Preprint Working paperForskning

Standard

Exact Algorithms for Solving Stochastic Games. / Hansen, Kristoffer Arnsfelt; Koucky, Michal; Lauritzen, Niels et al.
2012.

Publikation: Working paper/Preprint Working paperForskning

Harvard

APA

CBE

MLA

Vancouver

Author

Bibtex

@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",

}

RIS

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 -