Solving parity games via priority promotion
We consider parity games, a special form of two-player infinite-duration games on numerically labelled graphs, whose winning condition requires that the maximal value of a label occurring infinitely often during a play be of some specific parity. The problem has a rather intriguing status from a com...
Үндсэн зохиолчид: | Benerecetti, M, Dell Erba, D, Mogavero, F |
---|---|
Формат: | Conference item |
Хэвлэсэн: |
Springer
2016
|
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
Improving Priority Promotion for Parity Games
-н: Benerecetti, M, зэрэг
Хэвлэсэн: (2016) -
A delayed promotion policy for parity games
-н: Benerecetti, M, зэрэг
Хэвлэсэн: (2016) -
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
-н: Massimo Benerecetti, зэрэг
Хэвлэсэн: (2017-09-01) -
Smaller progress measures and separating automata for parity games
-н: Daniele Dell'Erba, зэрэг
Хэвлэсэн: (2022-09-01) -
Solving parity games using an automata-based algorithm
-н: Di Stasio, A, зэрэг
Хэвлэсэн: (2016)