The complexity of solving stochastic games on graphs

Daniel Andersson; Peter Bro Miltersen

doi:10.1007/978-3-642-10631-6_13

The complexity of solving stochastic games on graphs

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Konferenceartikel › Forskning › peer review

Originalsprog	Engelsk
Bogserie	Lecture Notes in Computer Science
Sider (fra-til)	112-121
Antal sider	10
ISSN	0302-9743
DOI	https://doi.org/10.1007/978-3-642-10631-6_13
Status	Udgivet - 2009
Begivenhed	International Symposium on Algorithms and Computation (ISAAC) - Honolulu, USA Varighed: 16 dec. 2009 → 18 dec. 2009 Konferencens nummer: 20

Konference

Konference	International Symposium on Algorithms and Computation (ISAAC)
Nummer	20
Land/Område	USA
By	Honolulu
Periode	16/12/2009 → 18/12/2009

Adgang til dokumentet

10.1007/978-3-642-10631-6_13

Citationsformater

@inproceedings{c1a6ce40bfd411de82fe000ea68e967b,

title = "The complexity of solving stochastic games on graphs",

author = "Daniel Andersson and Miltersen, {Peter Bro}",

note = "Title of the vol.: Algorithms and Computation. Proceedings / Yingfei Dong Ding-ZhuDu Oscar Ibarra (Eds.) ISBN: 3-642-10630-7; 978-3-642-10630-9 Volumne: 5878; International Symposium on Algorithms and Computation (ISAAC) ; Conference date: 16-12-2009 Through 18-12-2009",

year = "2009",

doi = "10.1007/978-3-642-10631-6_13",

language = "English",

pages = "112--121",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer",

}

TY - GEN

T1 - The complexity of solving stochastic games on graphs

AU - Andersson, Daniel

AU - Miltersen, Peter Bro

N1 - Conference code: 20

PY - 2009

Y1 - 2009

U2 - 10.1007/978-3-642-10631-6_13

DO - 10.1007/978-3-642-10631-6_13

M3 - Conference article

SN - 0302-9743

SP - 112

EP - 121

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - International Symposium on Algorithms and Computation (ISAAC)

Y2 - 16 December 2009 through 18 December 2009

ER -