×

Found 130 Documents (Results 1–100)

The complexity of SPEs in mean-payoff games. (English) Zbl 07870326

Bojańczyk, Mikołaj (ed.) et al., 49th EATCS international conference on automata, languages, and programming, ICALP 2022, Paris, France, July 4–8, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 229, Article 116, 20 p. (2022).
MSC:  68Nxx 68Qxx

On the complexity of SPEs in parity games. (English) Zbl 07830366

Manea, Florin (ed.) et al., 30th EACSL annual conference on computer science logic, CSL 2022, Göttingen, Germany, virtual conference, February 14–19, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 216, Article 10, 17 p. (2022).
MSC:  68-XX 91-XX

The complexity of subgame perfect equilibria in quantitative reachability games. (English) Zbl 1519.91051

Fokkink, Wan (ed.) et al., 30th international conference on concurrency theory, CONCUR 2019, Amsterdam, the Netherlands, August 27–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 140, Article 13, 16 p. (2019).
Full Text: DOI

Equilibria for discounted stochastic games. (English) Zbl 1153.91330

Neyman, Abraham (ed.) et al., Stochastic games and applications. Lectures given at the NATO Advanced Study Institute on “Stochastic games and applications”, Stony Brook, NY, USA, July 1999. On the occasion of L. S. Shapley’s eightieth birthday. Dordrecht: Kluwer Academic Publishers (ISBN 1-4020-1492-9/hbk). NATO ASI Ser., Ser. C, Math. Phys. Sci. 570, 131-172 (2003).
MSC:  91A15

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software