---
OA_place: publisher
_id: '20234'
abstract:
- lang: eng
text: "Game Theory is the mathematical formalization of social dynamics - systems
where agents interact over time and the evolution of the state of the system depends
on the decisions of every player. \r\nThis thesis takes the perspective of a single
player and focuses on what they can guarantee in the worst case over the behavior
of other players.\r\nIn other words, we consider that the objective of every other
player in the game is exactly the opposite to the player.\r\nWe focus on sustained
interactions over time, where the players repeatedly obtain quantitative rewards
over time, and they are interested in maximizing their long-term performance.\t\r\nFormally,
this thesis focuses on zero-sum games with the liminf average objective.\r\nTwo
fundamental questions that Game Theory aims to answer are the following.\r\n\r\n1.
How much can a player guarantee to obtain after the interaction?\r\n\r\n2. How
to act in order to obtain the previously mentioned guarantee?\r\n\r\nThese questions
are formalized by the concepts of \"value\" and \"optimal strategies\". \t\r\nWe
study their properties on games that exhibit one or more of the following properties.
\r\n\r\n1. Partial Observation: \r\nthe players can not perfectly observe the
current state of the system during the game. We consider the model of (finite)
Partially Observable Markov Decision Processes and prove that finite-memory strategies
are sufficient to approximately guarantee the value.\r\n\r\n2. Perturbed Description:
\r\nthe formal description of the game is perturbed by a small parameter.\r\nWe
consider the model of (finite) Perturbed Matrix Games, and provide algorithms
to check various robustness properties and to compute the parameterized value
and optimal strategies.\r\n\r\n3. Stochastic Transitions: \r\nthe actions of the
players determine the behavior of the evolution of the system, described as a
probability distribution over the next state.\r\nWe consider the model of (finite)
Perturbed Stochastic Games and provide formulas for the marginal value.\r\n\r\n4.
Infinite States: \r\nthe system can be in infinitely many states.\r\nWe consider
the model of Random Dynamic Games on a class of infinite graphs, prove the existence
of the value, and quantify the concentration of finite-horizon values."
acknowledgement: "Funding sources The works included in this thesis were partially
supported by:\r\n• Austrian Science Fund (FWF), grants 10.55776/COE12 and No RiSE/SHiNE
S11407,\r\n• French Agence Nationale de la Recherche (ANR), grants ANR-21-CE40-0020
(CONVERGENCE) and ANR-20-CE40-0002 (GrHyDy),\r\n• Fondation Mathématique Jaques
Hadamard, grant PGMO RSG 2018-0031H,\r\n• European Research Council (ERC), Consolidator
grant 863818 (ForM-SMArt),\r\n• Agencia Nacional de Investigación y Desarrollo (ANID
Chile), grant ACT210005,\r\n• Fondo Nacional de Desarrollo Científico y Tecnológico
(Fondecyt Chile), grant 1220174,\r\n• Comisión Nacional de Investigación Científica
y Tecnológica (CONICYT Chile), grant\r\nPII 20150140,\r\n• Evaluation-orientation
de la Coopération Scientifique and Comisión Nacional de Investigación Científica
y Tecnológica (ECOS-CONICYT), grant C15E03,\r\n• European Cooperation in Science
and Technology (E-COST), grants CA16228 - European\r\nNetwork for Game Theory (GAMENET)
and E-COST-GRANT-CA16228-c5a69859.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
citation:
ama: 'Saona Urmeneta RJ. Robustness of solutions in game theory: Values and strategies
in partially observable, perturbed, stochastic, and infinite games. 2025. doi:10.15479/AT-ISTA-20234'
apa: 'Saona Urmeneta, R. J. (2025). Robustness of solutions in game theory: Values
and strategies in partially observable, perturbed, stochastic, and infinite games.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20234'
chicago: 'Saona Urmeneta, Raimundo J. “Robustness of Solutions in Game Theory: Values
and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games.”
Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20234.'
ieee: 'R. J. Saona Urmeneta, “Robustness of solutions in game theory: Values and
strategies in partially observable, perturbed, stochastic, and infinite games,”
Institute of Science and Technology Austria, 2025.'
ista: 'Saona Urmeneta RJ. 2025. Robustness of solutions in game theory: Values and
strategies in partially observable, perturbed, stochastic, and infinite games.
Institute of Science and Technology Austria.'
mla: 'Saona Urmeneta, Raimundo J. Robustness of Solutions in Game Theory: Values
and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games.
Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20234.'
short: 'R.J. Saona Urmeneta, Robustness of Solutions in Game Theory: Values and
Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games,
Institute of Science and Technology Austria, 2025.'
corr_author: '1'
date_created: 2025-08-27T14:00:13Z
date_published: 2025-08-27T00:00:00Z
date_updated: 2026-07-29T13:14:37Z
day: '27'
ddc:
- '519'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrCh
doi: 10.15479/AT-ISTA-20234
doi_confirm: '1'
ec_funded: 1
file:
- access_level: open_access
checksum: 394a651f7de7085e509ef856ffe7bd97
content_type: application/pdf
creator: rsaonaur
date_created: 2025-08-28T14:47:07Z
date_updated: 2025-08-28T14:47:07Z
file_id: '20240'
file_name: 2025_Saona_Raimundo_Thesis.pdf
file_size: 1503623
relation: main_file
success: 1
- access_level: closed
checksum: 09fb2633e66aac80433d373f4180c5b4
content_type: application/zip
creator: rsaonaur
date_created: 2025-08-28T14:47:12Z
date_updated: 2025-08-28T14:47:12Z
file_id: '20241'
file_name: 2025_Saona_Raimundo_Thesis.zip
file_size: 622747
relation: source_file
file_date_updated: 2025-08-28T14:47:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '125'
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9311'
relation: part_of_dissertation
status: public
- id: '18266'
relation: part_of_dissertation
status: public
- id: '19508'
relation: part_of_dissertation
status: public
- id: '17037'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: 'Robustness of solutions in game theory: Values and strategies in partially
observable, perturbed, stochastic, and infinite games'
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2025'
...
---
_id: '11402'
abstract:
- lang: eng
text: Fixed-horizon planning considers a weighted graph and asks to construct a
path that maximizes the sum of weights for a given time horizon T. However, in
many scenarios, the time horizon is not fixed, but the stopping time is chosen
according to some distribution such that the expected stopping time is T. If the
stopping-time distribution is not known, then to ensure robustness, the distribution
is chosen by an adversary as the worst-case scenario. A stationary plan for every
vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time
distribution, stationary plans are not sufficient for optimality. Quite surprisingly
we show that when an adversary chooses the stopping-time distribution with expected
stopping-time T, then stationary plans are sufficient. While computing optimal
stationary plans for fixed horizon is NP-complete, we show that computing optimal
stationary plans under adversarial stopping-time distribution can be achieved
in polynomial time.
acknowledgement: This work was partially supported by Austrian Science Fund (FWF)
NFN Grant No RiSE/SHiNE S11407 and by the grant ERC CoG 863818 (ForM-SMArt).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: Chatterjee K, Doyen L. Graph planning with expected finite horizon. Journal
of Computer and System Sciences. 2022;129:1-21. doi:10.1016/j.jcss.2022.04.003
apa: Chatterjee, K., & Doyen, L. (2022). Graph planning with expected finite
horizon. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2022.04.003
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected
Finite Horizon.” Journal of Computer and System Sciences. Elsevier, 2022.
https://doi.org/10.1016/j.jcss.2022.04.003.
ieee: K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,”
Journal of Computer and System Sciences, vol. 129. Elsevier, pp. 1–21,
2022.
ista: Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon.
Journal of Computer and System Sciences. 129, 1–21.
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite
Horizon.” Journal of Computer and System Sciences, vol. 129, Elsevier,
2022, pp. 1–21, doi:10.1016/j.jcss.2022.04.003.
short: K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022)
1–21.
date_created: 2022-05-22T22:01:40Z
date_published: 2022-11-01T00:00:00Z
date_updated: 2025-07-10T11:54:34Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.jcss.2022.04.003
ec_funded: 1
external_id:
arxiv:
- '1802.03642'
isi:
- '000805002800001'
intvolume: ' 129'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1802.03642'
month: '11'
oa: 1
oa_version: Preprint
page: 1-21
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Journal of Computer and System Sciences
publication_identifier:
eissn:
- 1090-2724
issn:
- 0022-0000
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '7402'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Graph planning with expected finite horizon
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 129
year: '2022'
...
---
_id: '11938'
abstract:
- lang: eng
text: A matching is compatible to two or more labeled point sets of size n with
labels {1, . . . , n} if its straight-line drawing on each of these point sets
is crossing-free. We study the maximum number of edges in a matching compatible
to two or more labeled point sets in general position in the plane. We show that
for any two labeled sets of n points in convex position there exists a compatible
matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets
we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound,
we use probabilistic arguments to show that for any ℓ given sets of n points there
exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1))
edges. Finally, we show that Θ(log n) copies of any set of n points are necessary
and sufficient for the existence of labelings of these point sets such that any
compatible matching consists only of a single edge.
acknowledgement: 'A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411.
Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative
DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported
by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by
ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23
(RiSE).'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Irene
full_name: Parada, Irene
last_name: Parada
- first_name: Daniel
full_name: Perz, Daniel
last_name: Perz
- first_name: Alexander
full_name: Pilz, Alexander
last_name: Pilz
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Birgit
full_name: Vogtenhuber, Birgit
last_name: Vogtenhuber
citation:
ama: Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings.
Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591
apa: Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D.,
Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph
Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591
chicago: Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada,
Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible
Matchings.” Journal of Graph Algorithms and Applications. Brown University,
2022. https://doi.org/10.7155/jgaa.00591.
ieee: O. Aichholzer et al., “On compatible matchings,” Journal of Graph
Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240,
2022.
ista: Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec
J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and
Applications. 26(2), 225–240.
mla: Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms
and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.
short: O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz,
J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022)
225–240.
corr_author: '1'
date_created: 2022-08-21T22:01:56Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2026-04-16T09:18:20Z
day: '01'
ddc:
- '000'
department:
- _id: UlWa
- _id: HeEd
- _id: KrCh
doi: 10.7155/jgaa.00591
ec_funded: 1
external_id:
arxiv:
- '2101.03928'
file:
- access_level: open_access
checksum: dc6e255e3558faff924fd9e370886c11
content_type: application/pdf
creator: dernst
date_created: 2022-08-22T06:42:42Z
date_updated: 2022-08-22T06:42:42Z
file_id: '11940'
file_name: 2022_JourGraphAlgorithmsApplic_Aichholzer.pdf
file_size: 694538
relation: main_file
success: 1
file_date_updated: 2022-08-22T06:42:42Z
has_accepted_license: '1'
intvolume: ' 26'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '06'
oa: 1
oa_version: Published Version
page: 225-240
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Journal of Graph Algorithms and Applications
publication_identifier:
issn:
- 1526-1719
publication_status: published
publisher: Brown University
quality_controlled: '1'
related_material:
record:
- id: '9296'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: On compatible matchings
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2022'
...
---
_id: '12257'
abstract:
- lang: eng
text: Structural balance theory is an established framework for studying social
relationships of friendship and enmity. These relationships are modeled by a signed
network whose energy potential measures the level of imbalance, while stochastic
dynamics drives the network toward a state of minimum energy that captures social
balance. It is known that this energy landscape has local minima that can trap
socially aware dynamics, preventing it from reaching balance. Here we first study
the robustness and attractor properties of these local minima. We show that a
stochastic process can reach them from an abundance of initial states and that
some local minima cannot be escaped by mild perturbations of the network. Motivated
by these anomalies, we introduce best-edge dynamics (BED), a new plausible stochastic
process. We prove that BED always reaches balance and that it does so fast in
various interesting settings.
acknowledgement: "K.C. acknowledges support from ERC Start Grant No. (279307: Graph
Games), ERC Consolidator Grant No. (863818: ForM-SMart), and Austrian Science Fund
(FWF)\r\nGrants No. P23499-N23 and No. S11407-N23 (RiSE). This project has received
funding from the European Union’s Horizon 2020 research and innovation programme
under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385."
article_number: '034321'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
citation:
ama: 'Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. Social balance
on networks: Local minima and best-edge dynamics. Physical Review E. 2022;106(3).
doi:10.1103/physreve.106.034321'
apa: 'Chatterjee, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., & Tkadlec,
J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical
Review E. American Physical Society. https://doi.org/10.1103/physreve.106.034321'
chicago: 'Chatterjee, Krishnendu, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis,
and Josef Tkadlec. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.”
Physical Review E. American Physical Society, 2022. https://doi.org/10.1103/physreve.106.034321.'
ieee: 'K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social
balance on networks: Local minima and best-edge dynamics,” Physical Review
E, vol. 106, no. 3. American Physical Society, 2022.'
ista: 'Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. 2022. Social
balance on networks: Local minima and best-edge dynamics. Physical Review E. 106(3),
034321.'
mla: 'Chatterjee, Krishnendu, et al. “Social Balance on Networks: Local Minima and
Best-Edge Dynamics.” Physical Review E, vol. 106, no. 3, 034321, American
Physical Society, 2022, doi:10.1103/physreve.106.034321.'
short: K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, J. Tkadlec, Physical
Review E 106 (2022).
date_created: 2023-01-16T09:57:57Z
date_published: 2022-09-29T00:00:00Z
date_updated: 2026-07-27T12:52:03Z
day: '29'
department:
- _id: KrCh
doi: 10.1103/physreve.106.034321
ec_funded: 1
external_id:
arxiv:
- '2210.02394'
isi:
- '000870243100001'
intvolume: ' 106'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2210.02394
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Physical Review E
publication_identifier:
eissn:
- 2470-0053
issn:
- 2470-0045
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '20138'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Social balance on networks: Local minima and best-edge dynamics'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 106
year: '2022'
...
---
_id: '9311'
abstract:
- lang: eng
text: 'Partially observable Markov decision processes (POMDPs) are standard models
for dynamic systems with probabilistic and nondeterministic behaviour in uncertain
environments. We prove that in POMDPs with long-run average objective, the decision
maker has approximately optimal strategies with finite memory. This implies notably
that approximating the long-run value is recursively enumerable, as well as a
weak continuity property of the value with respect to the transition function. '
acknowledgement: "Partially supported by Austrian Science Fund (FWF) NFN Grant No
RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT
through grant C15E03.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
- first_name: Bruno
full_name: Ziliotto, Bruno
last_name: Ziliotto
citation:
ama: Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs
with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119.
doi:10.1287/moor.2020.1116
apa: Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory
strategies in POMDPs with long-run average objectives. Mathematics of Operations
Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116
chicago: Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto.
“Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics
of Operations Research. Institute for Operations Research and the Management
Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.
ieee: K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies
in POMDPs with long-run average objectives,” Mathematics of Operations Research,
vol. 47, no. 1. Institute for Operations Research and the Management Sciences,
pp. 100–119, 2022.
ista: Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies
in POMDPs with long-run average objectives. Mathematics of Operations Research.
47(1), 100–119.
mla: Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run
Average Objectives.” Mathematics of Operations Research, vol. 47, no. 1,
Institute for Operations Research and the Management Sciences, 2022, pp. 100–19,
doi:10.1287/moor.2020.1116.
short: K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations
Research 47 (2022) 100–119.
date_created: 2021-04-08T09:33:31Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2026-07-29T13:14:36Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1287/moor.2020.1116
external_id:
arxiv:
- '1904.13360'
isi:
- '000731918100001'
intvolume: ' 47'
isi: 1
issue: '1'
keyword:
- Management Science and Operations Research
- General Mathematics
- Computer Science Applications
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.13360
month: '02'
oa: 1
oa_version: Preprint
page: 100-119
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Mathematics of Operations Research
publication_identifier:
eissn:
- 1526-5471
issn:
- 0364-765X
publication_status: published
publisher: Institute for Operations Research and the Management Sciences
quality_controlled: '1'
related_material:
record:
- id: '20234'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Finite-memory strategies in POMDPs with long-run average objectives
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 47
year: '2022'
...
---
_id: '8793'
abstract:
- lang: eng
text: We study optimal election sequences for repeatedly selecting a (very) small
group of leaders among a set of participants (players) with publicly known unique
ids. In every time slot, every player has to select exactly one player that it
considers to be the current leader, oblivious to the selection of the other players,
but with the overarching goal of maximizing a given parameterized global (“social”)
payoff function in the limit. We consider a quite generic model, where the local
payoff achieved by a given player depends, weighted by some arbitrary but fixed
real parameter, on the number of different leaders chosen in a round, the number
of players that choose the given player as the leader, and whether the chosen
leader has changed w.r.t. the previous round or not. The social payoff can be
the maximum, average or minimum local payoff of the players. Possible applications
include quite diverse examples such as rotating coordinator-based distributed
algorithms and long-haul formation flying of social birds. Depending on the weights
and the particular social payoff, optimal sequences can be very different, from
simple round-robin where all players chose the same leader alternatingly every
time slot to very exotic patterns, where a small group of leaders (at most 2)
is elected in every time slot. Moreover, we study the question if and when a single
player would not benefit w.r.t. its local payoff when deviating from the given
optimal sequence, i.e., when our optimal sequences are Nash equilibria in the
restricted strategy space of oblivious strategies. As this is the case for many
parameterizations of our model, our results reveal that no punishment is needed
to make it rational for the players to optimize the social payoff.
acknowledgement: "We are grateful to Matthias Függer and Thomas Nowak for having raised
our interest in the problem studied in this paper.\r\nThis work has been supported
the Austrian Science Fund (FWF) projects S11405, S11407 (RiSE), and P28182 (ADynNet)."
article_processing_charge: No
article_type: original
author:
- first_name: Martin
full_name: Zeiner, Martin
last_name: Zeiner
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Zeiner M, Schmid U, Chatterjee K. Optimal strategies for selecting coordinators.
Discrete Applied Mathematics. 2021;289(1):392-415. doi:10.1016/j.dam.2020.10.022
apa: Zeiner, M., Schmid, U., & Chatterjee, K. (2021). Optimal strategies for
selecting coordinators. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2020.10.022
chicago: Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies
for Selecting Coordinators.” Discrete Applied Mathematics. Elsevier, 2021.
https://doi.org/10.1016/j.dam.2020.10.022.
ieee: M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting
coordinators,” Discrete Applied Mathematics, vol. 289, no. 1. Elsevier,
pp. 392–415, 2021.
ista: Zeiner M, Schmid U, Chatterjee K. 2021. Optimal strategies for selecting coordinators.
Discrete Applied Mathematics. 289(1), 392–415.
mla: Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.” Discrete
Applied Mathematics, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:10.1016/j.dam.2020.10.022.
short: M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021)
392–415.
corr_author: '1'
date_created: 2020-11-22T23:01:26Z
date_published: 2021-01-31T00:00:00Z
date_updated: 2026-04-16T09:15:13Z
day: '31'
ddc:
- '510'
department:
- _id: KrCh
doi: 10.1016/j.dam.2020.10.022
external_id:
isi:
- '000596823800035'
file:
- access_level: open_access
checksum: f1039ff5a2d6ca116720efdb84ee9d5e
content_type: application/pdf
creator: dernst
date_created: 2021-02-04T11:28:42Z
date_updated: 2021-02-04T11:28:42Z
file_id: '9089'
file_name: 2021_DiscreteApplMath_Zeiner.pdf
file_size: 652739
relation: main_file
success: 1
file_date_updated: 2021-02-04T11:28:42Z
has_accepted_license: '1'
intvolume: ' 289'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 392-415
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Discrete Applied Mathematics
publication_identifier:
eissn:
- 1872-6771
issn:
- 0166-218X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal strategies for selecting coordinators
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 289
year: '2021'
...
---
_id: '9296'
abstract:
- lang: eng
text: ' matching is compatible to two or more labeled point sets of size n with
labels {1,…,n} if its straight-line drawing on each of these point sets is
crossing-free. We study the maximum number of edges in a matching compatible to
two or more labeled point sets in general position in the plane. We show that
for any two labeled convex sets of n points there exists a compatible matching
with ⌊2n−−√⌋ edges. More generally, for any ℓ labeled point sets we construct
compatible matchings of size Ω(n1/ℓ) . As a corresponding upper bound, we use
probabilistic arguments to show that for any ℓ given sets of n points there
exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges.
Finally, we show that Θ(logn) copies of any set of n points are necessary and
sufficient for the existence of a labeling such that any compatible matching consists
only of a single edge.'
acknowledgement: 'A.A. funded by the Marie Skłodowska-Curie grant agreement No. 754411.
Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative
DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported
by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by
ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23
(RiSE).'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Irene
full_name: Parada, Irene
last_name: Parada
- first_name: Daniel
full_name: Perz, Daniel
last_name: Perz
- first_name: Alexander
full_name: Pilz, Alexander
last_name: Pilz
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Birgit
full_name: Vogtenhuber, Birgit
last_name: Vogtenhuber
citation:
ama: 'Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings.
In: 15th International Conference on Algorithms and Computation. Vol 12635.
Springer Nature; 2021:221-233. doi:10.1007/978-3-030-68211-8_18'
apa: 'Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D.,
Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In 15th International
Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon,
Myanmar: Springer Nature. https://doi.org/10.1007/978-3-030-68211-8_18'
chicago: Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada,
Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible
Matchings.” In 15th International Conference on Algorithms and Computation,
12635:221–33. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-68211-8_18.
ieee: O. Aichholzer et al., “On compatible matchings,” in 15th International
Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635,
pp. 221–233.
ista: 'Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec
J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference
on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol.
12635, 221–233.'
mla: Aichholzer, Oswin, et al. “On Compatible Matchings.” 15th International
Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021,
pp. 221–33, doi:10.1007/978-3-030-68211-8_18.
short: O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz,
J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and
Computation, Springer Nature, 2021, pp. 221–233.
conference:
end_date: 2021-03-02
location: Yangon, Myanmar
name: 'WALCOM: Algorithms and Computation'
start_date: 2021-02-28
date_created: 2021-03-28T22:01:41Z
date_published: 2021-02-16T00:00:00Z
date_updated: 2026-04-16T09:18:21Z
day: '16'
department:
- _id: UlWa
- _id: HeEd
- _id: KrCh
doi: 10.1007/978-3-030-68211-8_18
ec_funded: 1
external_id:
arxiv:
- '2101.03928'
isi:
- '001435069600018'
intvolume: ' 12635'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2101.03928
month: '02'
oa: 1
oa_version: Preprint
page: 221-233
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: 15th International Conference on Algorithms and Computation
publication_identifier:
eisbn:
- '9783030682118'
eissn:
- 1611-3349
isbn:
- '9783030682101'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11938'
relation: later_version
status: public
scopus_import: '1'
status: public
title: On compatible matchings
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12635
year: '2021'
...
---
_id: '10002'
abstract:
- lang: eng
text: 'We present a faster symbolic algorithm for the following central problem
in probabilistic verification: Compute the maximal end-component (MEC) decomposition
of Markov decision processes (MDPs). This problem generalizes the SCC decomposition
problem of graphs and closed recurrent sets of Markov chains. The model of symbolic
algorithms is widely used in formal verification and model-checking, where access
to the input model is restricted to only symbolic operations (e.g., basic set
operations and computation of one-step neighborhood). For an input MDP with n vertices
and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition
requires O(n2) symbolic operations and O(1) symbolic space. The only other
symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations
and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound
for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic
operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our
algorithm provides a trade-off between symbolic operations and symbolic space:
for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations
and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques
we present faster algorithms for computing the almost-sure winning regions of ω
-regular objectives for MDPs. We consider the canonical parity objectives for ω
-regular objectives, and for parity objectives with d -priorities we present
an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic
operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 .'
acknowledgement: The authors are grateful to the anonymous referees for their valuable
comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF)
through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For
M. H. the research leading to these results has received funding from the European
Research Council under the European Unions Seventh Framework Programme (FP/2007–2013)
/ ERC Grant Agreement no. 340506.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorak, Wolfgang
last_name: Dvorak
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. Symbolic time and space tradeoffs
for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE
Symposium on Logic in Computer Science. IEEE; 2021:1-13. doi:10.1109/LICS52264.2021.9470739'
apa: 'Chatterjee, K., Dvorak, W., Henzinger, M., & Svozil, A. (2021). Symbolic
time and space tradeoffs for probabilistic verification. In Proceedings of
the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13).
Rome, Italy: IEEE. https://doi.org/10.1109/LICS52264.2021.9470739'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorak, Monika Henzinger, and Alexander
Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
1–13. IEEE, 2021. https://doi.org/10.1109/LICS52264.2021.9470739.
ieee: K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and
space tradeoffs for probabilistic verification,” in Proceedings of the 36th
Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021,
pp. 1–13.
ista: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space
tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE
Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic
Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in
Computer Science, IEEE, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.
short: K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil, in:, Proceedings of the
36th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2021, pp. 1–13.
conference:
end_date: 2021-07-02
location: Rome, Italy
name: 'LICS: Logic in Computer Science'
start_date: 2021-06-29
date_created: 2021-09-12T22:01:24Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2026-08-12T06:39:42Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470739
ec_funded: 1
external_id:
arxiv:
- '2104.07466'
isi:
- '000947350400089'
isi: 1
keyword:
- Computer science
- Computational modeling
- Markov processes
- Probabilistic logic
- Formal verification
- Game Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.07466
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_identifier:
eisbn:
- 978-1-6654-4895-6
isbn:
- 978-1-6654-4896-3
issn:
- 1043-6871
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic time and space tradeoffs for probabilistic verification
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '15055'
abstract:
- lang: eng
text: Markov decision processes (MDPs) are the defacto framework for sequential
decision making in the presence of stochastic uncertainty. A classical optimization
criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores
low probability catastrophic events with highly negative impact on the system.
On the other hand, risk-averse policies require the probability of undesirable
events to be below a given threshold, but they do not account for optimization
of the expected payoff. We consider MDPs with discounted-sum payoff with failure
states which represent catastrophic outcomes. The objective of risk-constrained
planning is to maximize the expected discounted-sum payoff among risk-averse policies
that ensure the probability to encounter a failure state is below a desired threshold.
Our main contribution is an efficient risk-constrained planning algorithm that
combines UCT-like search with a predictor learned through interaction with the
MDP (in the style of AlphaZero) and with a risk-constrained action selection via
linear programming. We demonstrate the effectiveness of our approach with experiments
on classical MDPs from the literature, including benchmarks with an order of 106
states.
acknowledgement: Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF)
NFN Grant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Tomas Brazdil is
supported by the Grant Agency of Masaryk University grant no. MUNI/G/0739/2017 and
by the Czech Science Foundation grant No. 18-11193S. Petr Novotny and Jirı Vahala
are supported by the Czech Science Foundation grant No. GJ19-15134Y.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Petr
full_name: Novotný, Petr
last_name: Novotný
- first_name: Jiří
full_name: Vahala, Jiří
last_name: Vahala
citation:
ama: Brázdil T, Chatterjee K, Novotný P, Vahala J. Reinforcement learning of risk-constrained
policies in Markov decision processes. Proceedings of the 34th AAAI Conference
on Artificial Intelligence. 2020;34(06):9794-9801. doi:10.1609/aaai.v34i06.6531
apa: 'Brázdil, T., Chatterjee, K., Novotný, P., & Vahala, J. (2020). Reinforcement
learning of risk-constrained policies in Markov decision processes. Proceedings
of the 34th AAAI Conference on Artificial Intelligence. New York, NY, United
States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i06.6531'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement
Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings
of the 34th AAAI Conference on Artificial Intelligence. Association for the
Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i06.6531.
ieee: T. Brázdil, K. Chatterjee, P. Novotný, and J. Vahala, “Reinforcement learning
of risk-constrained policies in Markov decision processes,” Proceedings of
the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06. Association
for the Advancement of Artificial Intelligence, pp. 9794–9801, 2020.
ista: Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning
of risk-constrained policies in Markov decision processes. Proceedings of the
34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.
mla: Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies
in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial
Intelligence, vol. 34, no. 06, Association for the Advancement of Artificial
Intelligence, 2020, pp. 9794–801, doi:10.1609/aaai.v34i06.6531.
short: T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th
AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801.
conference:
end_date: 2020-02-12
location: New York, NY, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2020-02-07
date_created: 2024-03-04T08:07:22Z
date_published: 2020-04-03T00:00:00Z
date_updated: 2025-04-15T06:30:08Z
day: '03'
department:
- _id: KrCh
doi: 10.1609/aaai.v34i06.6531
external_id:
arxiv:
- '2002.12086'
intvolume: ' 34'
issue: '06'
keyword:
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2002.12086
month: '04'
oa: 1
oa_version: Preprint
page: 9794-9801
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Proceedings of the 34th AAAI Conference on Artificial Intelligence
publication_identifier:
issn:
- 2374-3468
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
status: public
title: Reinforcement learning of risk-constrained policies in Markov decision processes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2020'
...
---
OA_place: publisher
_id: '19986'
abstract:
- lang: eng
text: 'For non-probabilistic programs, a key question in static analysis is termination,
which asks whether a given program terminates under a given initial condition.
In the presence of probabilistic behaviour, there are two fundamental extensions
of the termination question: (a) the almost-sure termination question, which asks
whether the termination probability is 1; and (b) the bounded-time termination
question, which asks whether the expected termination time is bounded. There are
many active research directions to address these two questions; one important
such direction is the use of martingale theory for termination analysis. In this
chapter, we survey the main techniques of the martingale-based approach to the
termination analysis of probabilistic programs.'
acknowledgement: "Krishnendu Chatterjee is supported by the Austrian Science Fund
(FWF) NFN\r\nGrant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Hongfei
Fu\r\nis supported by the National Natural Science Foundation of China (NSFC) Grant\r\nNo.
61802254. Petr Novotný is supported by the Czech Science Foundation grant\r\nNo.
GJ19-15134Y."
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
citation:
ama: 'Chatterjee K, Fu H, Novotný P. Termination Analysis of Probabilistic Programs
with Martingales. In: Foundations of Probabilistic Programming. Cambridge
University Press; 2020:221-258. doi:10.1017/9781108770750.008'
apa: Chatterjee, K., Fu, H., & Novotný, P. (2020). Termination Analysis of Probabilistic
Programs with Martingales. In Foundations of Probabilistic Programming
(pp. 221–258). Cambridge University Press. https://doi.org/10.1017/9781108770750.008
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Petr Novotný. “Termination Analysis
of Probabilistic Programs with Martingales.” In Foundations of Probabilistic
Programming, 221–58. Cambridge University Press, 2020. https://doi.org/10.1017/9781108770750.008.
ieee: K. Chatterjee, H. Fu, and P. Novotný, “Termination Analysis of Probabilistic
Programs with Martingales,” in Foundations of Probabilistic Programming,
Cambridge University Press, 2020, pp. 221–258.
ista: 'Chatterjee K, Fu H, Novotný P. 2020.Termination Analysis of Probabilistic
Programs with Martingales. In: Foundations of Probabilistic Programming. , 221–258.'
mla: Chatterjee, Krishnendu, et al. “Termination Analysis of Probabilistic Programs
with Martingales.” Foundations of Probabilistic Programming, Cambridge
University Press, 2020, pp. 221–58, doi:10.1017/9781108770750.008.
short: K. Chatterjee, H. Fu, P. Novotný, in:, Foundations of Probabilistic Programming,
Cambridge University Press, 2020, pp. 221–258.
corr_author: '1'
date_created: 2025-07-10T13:28:51Z
date_published: 2020-11-18T00:00:00Z
date_updated: 2025-09-23T12:10:25Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1017/9781108770750.008
file:
- access_level: open_access
checksum: 28ece115e8d2d9263e253a598e7caef2
content_type: application/pdf
creator: dernst
date_created: 2025-09-23T12:03:09Z
date_updated: 2025-09-23T12:03:09Z
file_id: '20380'
file_name: 2020_ProbProgramming_Chatterjee.pdf
file_size: 316681
relation: main_file
success: 1
file_date_updated: 2025-09-23T12:03:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 221-258
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Foundations of Probabilistic Programming
publication_identifier:
eisbn:
- '9781108770750'
isbn:
- '9781108488518'
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
status: public
title: Termination Analysis of Probabilistic Programs with Martingales
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8193'
abstract:
- lang: eng
text: 'Multiple-environment Markov decision processes (MEMDPs) are MDPs equipped
with not one, but multiple probabilistic transition functions, which represent
the various possible unknown environments. While the previous research on MEMDPs
focused on theoretical properties for long-run average payoff, we study them with
discounted-sum payoff and focus on their practical advantages and applications.
MEMDPs can be viewed as a special case of Partially observable and Mixed observability
MDPs: the state of the system is perfectly observable, but not the environment.
We show that the specific structure of MEMDPs allows for more efficient algorithmic
analysis, in particular for faster belief updates. We demonstrate the applicability
of MEMDPs in several domains. In particular, we formalize the sequential decision-making
approach to contextual recommendation systems as MEMDPs and substantially improve
over the previous MDP approach.'
acknowledgement: Krishnendu Chatterjee is supported by the Austrian ScienceFund (FWF)
NFN Grant No. S11407-N23 (RiSE/SHiNE),and COST Action GAMENET. Petr Novotn ́y is
supported bythe Czech Science Foundation grant No. GJ19-15134Y.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Deep
full_name: Karkhanis, Deep
last_name: Karkhanis
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Amélie
full_name: Royer, Amélie
id: 3811D890-F248-11E8-B48F-1D18A9856A87
last_name: Royer
orcid: 0000-0002-8407-0705
citation:
ama: 'Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. Multiple-environment
Markov decision processes: Efficient analysis and applications. In: Proceedings
of the 30th International Conference on Automated Planning and Scheduling.
Vol 30. Association for the Advancement of Artificial Intelligence; 2020:48-56.'
apa: 'Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., & Royer, A. (2020).
Multiple-environment Markov decision processes: Efficient analysis and applications.
In Proceedings of the 30th International Conference on Automated Planning and
Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement
of Artificial Intelligence.'
chicago: 'Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný,
and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis
and Applications.” In Proceedings of the 30th International Conference on Automated
Planning and Scheduling, 30:48–56. Association for the Advancement of Artificial
Intelligence, 2020.'
ieee: 'K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, and A. Royer, “Multiple-environment
Markov decision processes: Efficient analysis and applications,” in Proceedings
of the 30th International Conference on Automated Planning and Scheduling,
Nancy, France, 2020, vol. 30, pp. 48–56.'
ista: 'Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. 2020. Multiple-environment
Markov decision processes: Efficient analysis and applications. Proceedings of
the 30th International Conference on Automated Planning and Scheduling. ICAPS:
International Conference on Automated Planning and Scheduling vol. 30, 48–56.'
mla: 'Chatterjee, Krishnendu, et al. “Multiple-Environment Markov Decision Processes:
Efficient Analysis and Applications.” Proceedings of the 30th International
Conference on Automated Planning and Scheduling, vol. 30, Association for
the Advancement of Artificial Intelligence, 2020, pp. 48–56.'
short: K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, A. Royer, in:, Proceedings
of the 30th International Conference on Automated Planning and Scheduling, Association
for the Advancement of Artificial Intelligence, 2020, pp. 48–56.
conference:
end_date: 2020-10-30
location: Nancy, France
name: 'ICAPS: International Conference on Automated Planning and Scheduling'
start_date: 2020-10-26
date_created: 2020-08-02T22:00:58Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2026-04-08T07:26:44Z
day: '01'
department:
- _id: KrCh
intvolume: ' 30'
language:
- iso: eng
month: '06'
oa_version: None
page: 48-56
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Proceedings of the 30th International Conference on Automated Planning
and Scheduling
publication_identifier:
eissn:
- 2334-0843
issn:
- 2334-0835
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
related_material:
record:
- id: '8390'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Multiple-environment Markov decision processes: Efficient analysis and applications'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2020'
...
---
_id: '8324'
abstract:
- lang: eng
text: The notion of program sensitivity (aka Lipschitz continuity) specifies that
changes in the program input result in proportional changes to the program output.
For probabilistic programs the notion is naturally extended to expected sensitivity.
A previous approach develops a relational program logic framework for proving
expected sensitivity of probabilistic while loops, where the number of iterations
is fixed and bounded. In this work, we consider probabilistic while loops where
the number of iterations is not fixed, but randomized and depends on the initial
input values. We present a sound approach for proving expected sensitivity of
such programs. Our sound approach is martingale-based and can be automated through
existing martingale-synthesis algorithms. Furthermore, our approach is compositional
for sequential composition of while loops under a mild side condition. We demonstrate
the effectiveness of our approach on several classical examples from Gambler's
Ruin, stochastic hybrid systems and stochastic gradient descent. We also present
experimental results showing that our automated approach can handle various probabilistic
programs in the literature.
acknowledgement: We thank anonymous reviewers for helpful comments, especially for
pointing to us a scenario of piecewise-linear approximation (Remark5). The research
was partially supported by the National Natural Science Foundation of China (NSFC)
under Grant No. 61802254, 61672229, 61832015,61772336,11871221 and Austrian Science
Fund (FWF) NFN under Grant No. S11407-N23 (RiSE/SHiNE). We thank Prof. Yuxi Fu,
director of the BASICS Lab at Shanghai Jiao Tong University, for his support.
article_number: '25'
article_processing_charge: No
arxiv: 1
author:
- first_name: Peixin
full_name: Wang, Peixin
last_name: Wang
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Yuxin
full_name: Deng, Yuxin
last_name: Deng
- first_name: Ming
full_name: Xu, Ming
last_name: Xu
citation:
ama: 'Wang P, Fu H, Chatterjee K, Deng Y, Xu M. Proving expected sensitivity of
probabilistic programs with randomized variable-dependent termination time. In:
Proceedings of the ACM on Programming Languages. Vol 4. ACM; 2020. doi:10.1145/3371093'
apa: Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected
sensitivity of probabilistic programs with randomized variable-dependent termination
time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM.
https://doi.org/10.1145/3371093
chicago: Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu.
“Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent
Termination Time.” In Proceedings of the ACM on Programming Languages,
Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093.
ieee: P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity
of probabilistic programs with randomized variable-dependent termination time,”
in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL.
ista: Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity
of probabilistic programs with randomized variable-dependent termination time.
Proceedings of the ACM on Programming Languages. vol. 4, 25.
mla: Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs
with Randomized Variable-Dependent Termination Time.” Proceedings of the ACM
on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.
short: P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM
on Programming Languages, ACM, 2020.
date_created: 2020-08-30T22:01:12Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2025-04-15T06:30:10Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3371093
external_id:
arxiv:
- '1902.04744'
file:
- access_level: open_access
checksum: c6193d109ff4ecb17e7a6513d8eb34c0
content_type: application/pdf
creator: cziletti
date_created: 2020-09-01T11:12:58Z
date_updated: 2020-09-01T11:12:58Z
file_id: '8328'
file_name: 2019_ACM_POPL_Wang.pdf
file_size: 564151
relation: main_file
success: 1
file_date_updated: 2020-09-01T11:12:58Z
has_accepted_license: '1'
intvolume: ' 4'
issue: POPL
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://doi.org/10.5281/zenodo.3533633
scopus_import: '1'
status: public
title: Proving expected sensitivity of probabilistic programs with randomized variable-dependent
termination time
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2020'
...
---
_id: '8788'
abstract:
- lang: eng
text: 'We consider a real-time setting where an environment releases sequences of
firm-deadline tasks, and an online scheduler chooses on-the-fly the ones to execute
on a single processor so as to maximize cumulated utility. The competitive ratio
is a well-known performance measure for the scheduler: it gives the worst-case
ratio, among all possible choices for the environment, of the cumulated utility
of the online scheduler versus an offline scheduler that knows these choices in
advance. Traditionally, competitive analysis is performed by hand, while automated
techniques are rare and only handle static environments with independent tasks.
We present a quantitative-verification framework for precedence-aware competitive
analysis, where task releases may depend on preceding scheduling choices, i.e.,
the environment can respond to scheduling decisions dynamically . We consider
two general classes of precedences: 1) follower precedences force the release
of a dependent task upon the completion of a set of precursor tasks, while and
2) pairing precedences modify the characteristics of a dependent task provided
the completion of a set of precursor tasks. Precedences make competitive analysis
challenging, as the online and offline schedulers operate on diverging sequences.
We make a formal presentation of our framework, and use a GPU-based implementation
to analyze ten well-known schedulers on precedence-based application examples
taken from the existing literature: 1) a handshake protocol (HP); 2) network packet-switching;
3) query scheduling (QS); and 4) a sporadic-interrupt setting. Our experimental
results show that precedences and task parameters can vary drastically the best
scheduler. Our framework thus supports application designers in choosing the best
scheduler among a given set automatically.'
acknowledgement: 'This work was supported by the Austrian Science Foundation (FWF)
under the NFN RiSE/SHiNE under Grant S11405 and Grant S11407. This article was presented
in the International Conference on Embedded Software 2020 and appears as part of
the ESWEEK-TCAD special issue. '
article_processing_charge: No
article_type: original
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Nico
full_name: Schaumberger, Nico
last_name: Schaumberger
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. Precedence-aware automated
competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided
Design of Integrated Circuits and Systems. 2020;39(11):3981-3992. doi:10.1109/TCAD.2020.3012803
apa: Pavlogiannis, A., Schaumberger, N., Schmid, U., & Chatterjee, K. (2020).
Precedence-aware automated competitive analysis of real-time scheduling. IEEE
Transactions on Computer-Aided Design of Integrated Circuits and Systems.
IEEE. https://doi.org/10.1109/TCAD.2020.3012803
chicago: Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu
Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.”
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012803.
ieee: A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “Precedence-aware
automated competitive analysis of real-time scheduling,” IEEE Transactions
on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no.
11. IEEE, pp. 3981–3992, 2020.
ista: Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. 2020. Precedence-aware
automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided
Design of Integrated Circuits and Systems. 39(11), 3981–3992.
mla: Pavlogiannis, Andreas, et al. “Precedence-Aware Automated Competitive Analysis
of Real-Time Scheduling.” IEEE Transactions on Computer-Aided Design of Integrated
Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 3981–92, doi:10.1109/TCAD.2020.3012803.
short: A. Pavlogiannis, N. Schaumberger, U. Schmid, K. Chatterjee, IEEE Transactions
on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 3981–3992.
date_created: 2020-11-22T23:01:24Z
date_published: 2020-11-01T00:00:00Z
date_updated: 2026-04-02T14:37:50Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/TCAD.2020.3012803
external_id:
isi:
- '000587712700069'
intvolume: ' 39'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
page: 3981-3992
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: IEEE Transactions on Computer-Aided Design of Integrated Circuits and
Systems
publication_identifier:
eissn:
- 1937-4151
issn:
- 0278-0070
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Precedence-aware automated competitive analysis of real-time scheduling
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
_id: '7212'
abstract:
- lang: eng
text: The fixation probability of a single mutant invading a population of residents
is among the most widely-studied quantities in evolutionary dynamics. Amplifiers
of natural selection are population structures that increase the fixation probability
of advantageous mutants, compared to well-mixed populations. Extensive studies
have shown that many amplifiers exist for the Birth-death Moran process, some
of them substantially increasing the fixation probability or even guaranteeing
fixation in the limit of large population size. On the other hand, no amplifiers
are known for the death-Birth Moran process, and computer-assisted exhaustive
searches have failed to discover amplification. In this work we resolve this disparity,
by showing that any amplification under death-Birth updating is necessarily bounded
and transient. Our boundedness result states that even if a population structure
does amplify selection, the resulting fixation probability is close to that of
the well-mixed population. Our transience result states that for any population
structure there exists a threshold r⋆ such that the population structure ceases
to amplify selection if the mutant fitness advantage r is larger than r⋆. Finally,
we also extend the above results to δ-death-Birth updating, which is a combination
of Birth-death and death-Birth updating. On the positive side, we identify population
structures that maintain amplification for a wide range of values r and δ. These
results demonstrate that amplification of natural selection depends on the specific
mechanisms of the evolutionary process.
article_number: e1007494
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin A.
full_name: Nowak, Martin A.
last_name: Nowak
citation:
ama: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Limits on amplifiers of
natural selection under death-Birth updating. PLoS computational biology.
2020;16. doi:10.1371/journal.pcbi.1007494
apa: Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2020). Limits
on amplifiers of natural selection under death-Birth updating. PLoS Computational
Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007494
chicago: Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin
A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.”
PLoS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007494.
ieee: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers
of natural selection under death-Birth updating,” PLoS computational biology,
vol. 16. Public Library of Science, 2020.
ista: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers
of natural selection under death-Birth updating. PLoS computational biology. 16,
e1007494.
mla: Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth
Updating.” PLoS Computational Biology, vol. 16, e1007494, Public Library
of Science, 2020, doi:10.1371/journal.pcbi.1007494.
short: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, PLoS Computational
Biology 16 (2020).
date_created: 2019-12-23T13:45:11Z
date_published: 2020-01-17T00:00:00Z
date_updated: 2026-04-16T08:32:38Z
day: '17'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1371/journal.pcbi.1007494
ec_funded: 1
external_id:
arxiv:
- '1906.02785'
isi:
- '000510916500025'
file:
- access_level: open_access
checksum: ce32ee2d2f53aed832f78bbd47e882df
content_type: application/pdf
creator: dernst
date_created: 2020-02-03T07:32:42Z
date_updated: 2020-07-14T12:47:53Z
file_id: '7441'
file_name: 2020_PlosCompBio_Tkadlec.pdf
file_size: 1817531
relation: main_file
file_date_updated: 2020-07-14T12:47:53Z
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: PLoS computational biology
publication_identifier:
eissn:
- 1553-7358
issn:
- 1553-734X
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
record:
- id: '7196'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Limits on amplifiers of natural selection under death-Birth updating
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 16
year: '2020'
...
---
OA_place: repository
OA_type: green
_id: '7426'
abstract:
- lang: eng
text: This paper presents a novel abstraction technique for analyzing Lyapunov and
asymptotic stability of polyhedral switched systems. A polyhedral switched system
is a hybrid system in which the continuous dynamics is specified by polyhedral
differential inclusions, the invariants and guards are specified by polyhedral
sets and the switching between the modes do not involve reset of variables. A
finite state weighted graph abstracting the polyhedral switched system is constructed
from a finite partition of the state–space, such that the satisfaction of certain
graph conditions, such as the absence of cycles with product of weights on the
edges greater than (or equal) to 1, implies the stability of the system. However,
the graph is in general conservative and hence, the violation of the graph conditions
does not imply instability. If the analysis fails to establish stability due to
the conservativeness in the approximation, a counterexample (cycle with product
of edge weights greater than or equal to 1) indicating a potential reason for
the failure is returned. Further, a more precise approximation of the switched
system can be constructed by considering a finer partition of the state–space
in the construction of the finite weighted graph. We present experimental results
on analyzing stability of switched systems using the above method.
article_number: '100856'
article_processing_charge: No
article_type: original
author:
- first_name: Miriam
full_name: Garcia Soto, Miriam
id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
last_name: Garcia Soto
orcid: 0000−0003−2936−5719
- first_name: Pavithra
full_name: Prabhakar, Pavithra
last_name: Prabhakar
citation:
ama: 'Garcia Soto M, Prabhakar P. Abstraction based verification of stability of
polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. 2020;36(5).
doi:10.1016/j.nahs.2020.100856'
apa: 'Garcia Soto, M., & Prabhakar, P. (2020). Abstraction based verification
of stability of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems.
Elsevier. https://doi.org/10.1016/j.nahs.2020.100856'
chicago: 'Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification
of Stability of Polyhedral Switched Systems.” Nonlinear Analysis: Hybrid Systems.
Elsevier, 2020. https://doi.org/10.1016/j.nahs.2020.100856.'
ieee: 'M. Garcia Soto and P. Prabhakar, “Abstraction based verification of stability
of polyhedral switched systems,” Nonlinear Analysis: Hybrid Systems, vol.
36, no. 5. Elsevier, 2020.'
ista: 'Garcia Soto M, Prabhakar P. 2020. Abstraction based verification of stability
of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. 36(5), 100856.'
mla: 'Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification
of Stability of Polyhedral Switched Systems.” Nonlinear Analysis: Hybrid Systems,
vol. 36, no. 5, 100856, Elsevier, 2020, doi:10.1016/j.nahs.2020.100856.'
short: 'M. Garcia Soto, P. Prabhakar, Nonlinear Analysis: Hybrid Systems 36 (2020).'
corr_author: '1'
date_created: 2020-02-02T23:00:59Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2026-07-28T12:57:27Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1016/j.nahs.2020.100856
external_id:
isi:
- '000528828600003'
file:
- access_level: open_access
checksum: 560abfddb53f9fe921b6744f59f2cfaa
content_type: application/pdf
creator: dernst
date_created: 2020-10-21T13:16:45Z
date_updated: 2022-05-16T22:30:04Z
embargo: 2022-05-15
file_id: '8688'
file_name: 2020_NAHS_GarciaSoto.pdf
file_size: 818774
relation: main_file
file_date_updated: 2022-05-16T22:30:04Z
has_accepted_license: '1'
intvolume: ' 36'
isi: 1
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: 'Nonlinear Analysis: Hybrid Systems'
publication_identifier:
issn:
- 1751-570X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Abstraction based verification of stability of polyhedral switched systems
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2020'
...
---
OA_place: publisher
OA_type: hybrid
_id: '10190'
abstract:
- lang: eng
text: 'The verification of concurrent programs remains an open challenge, as thread
interaction has to be accounted for, which leads to state-space explosion. Stateless
model checking battles this problem by exploring traces rather than states of
the program. As there are exponentially many traces, dynamic partial-order reduction
(DPOR) techniques are used to partition the trace space into equivalence classes,
and explore a few representatives from each class. The standard equivalence that
underlies most DPOR techniques is the happens-before equivalence, however recent
works have spawned a vivid interest towards coarser equivalences. The efficiency
of such approaches is a product of two parameters: (i) the size of the partitioning
induced by the equivalence, and (ii) the time spent by the exploration algorithm
in each class of the partitioning. In this work, we present a new equivalence,
called value-happens-before and show that it has two appealing features. First,
value-happens-before is always at least as coarse as the happens-before equivalence,
and can be even exponentially coarser. Second, the value-happens-before partitioning
is efficiently explorable when the number of threads is bounded. We present an
algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning
using polynomial time per class. Finally, we perform an experimental evaluation
of VCDPOR on various benchmarks, and compare it against other state-of-the-art
approaches. Our results show that value-happens-before typically induces a significant
reduction in the size of the underlying partitioning, which leads to a considerable
reduction in the running time for exploring the whole partitioning.'
acknowledgement: "The authors would also like to thank anonymous referees for their
valuable comments and helpful suggestions. This work is supported by the Austrian
Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE),
by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian
Science Fund (FWF) Schrodinger grant J-4220.\r\n"
article_number: '124'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order
reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550'
apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic
partial order reduction. In Proceedings of the 34th ACM International Conference
on Object-Oriented Programming, Systems, Languages, and Applications (Vol.
3). Athens, Greece: ACM. https://doi.org/10.1145/3360550'
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric
Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International
Conference on Object-Oriented Programming, Systems, Languages, and Applications,
Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.
ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial
order reduction,” in Proceedings of the 34th ACM International Conference on
Object-Oriented Programming, Systems, Languages, and Applications, Athens,
Greece, 2019, vol. 3.
ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial
order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming,
Systems, Languages and Applications vol. 3, 124.'
mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”
Proceedings of the 34th ACM International Conference on Object-Oriented Programming,
Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM
International Conference on Object-Oriented Programming, Systems, Languages, and
Applications, ACM, 2019.
conference:
end_date: 2019-10-25
location: Athens, Greece
name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications'
start_date: 2019-10-23
corr_author: '1'
date_created: 2021-10-27T14:57:06Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2026-04-08T07:00:31Z
day: '10'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3360550
external_id:
arxiv:
- '1909.00989'
file:
- access_level: open_access
checksum: 2149979c46964c4d117af06ccb6c0834
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-12T11:41:56Z
date_updated: 2021-11-12T11:41:56Z
file_id: '10278'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 570829
relation: main_file
success: 1
file_date_updated: 2021-11-12T11:41:56Z
has_accepted_license: '1'
intvolume: ' 3'
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Value-centric dynamic partial order reduction
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2019'
...
---
_id: '6885'
abstract:
- lang: eng
text: 'A vector addition system with states (VASS) consists of a finite set of states
and counters. A configuration is a state and a value for each counter; a transition
changes the state and each counter is incremented, decremented, or left unchanged.
While qualitative properties such as state and configuration reachability have
been studied for VASS, we consider the long-run average cost of infinite computations
of VASS. The cost of a configuration is for each state, a linear combination of
the counter values. In the special case of uniform cost functions, the linear
combination is the same for all states. The (regular) long-run emptiness problem
is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped)
computation such that the long-run average value of the cost function does not
exceed the threshold. For uniform cost functions, we show that the regular long-run
emptiness problem is (a) decidable in polynomial time for integer-valued VASS,
and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative
counters). For general cost functions, we show that the problem is (c) NP-complete
for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most
interesting result is for (c) integer-valued VASS with general cost functions,
where we establish a connection between the regular long-run emptiness problem
and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness
problem is equally hard as the regular problem in all cases except (c), where
it remains open. '
alternative_title:
- LIPIcs
article_number: '27'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition
systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.27'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average
behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR:
Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average
Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.
ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of
vector addition systems with states,” presented at the CONCUR: Conference on Concurrency
Theory, Amsterdam, Netherlands, 2019, vol. 140.'
ista: 'Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector
addition systems with states. CONCUR: Conference on Concurrency Theory, LIPIcs,
vol. 140, 27.'
mla: Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition
Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2019-08-27
corr_author: '1'
date_created: 2019-09-18T08:06:14Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-07-10T11:53:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.27
file:
- access_level: open_access
checksum: 4985e26e1572d1575d64d38acabd71d6
content_type: application/pdf
creator: kschuh
date_created: 2019-09-27T12:09:35Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6914'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 538120
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long-run average behavior of vector addition systems with states
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2019'
...
---
_id: '6887'
abstract:
- lang: eng
text: 'The fundamental model-checking problem, given as input a model and a specification,
asks for the algorithmic verification of whether the model satisfies the specification.
Two classical models for reactive systems are graphs and Markov decision processes
(MDPs). A basic specification formalism in the verification of reactive systems
is the strong fairness (aka Streett) objective, where given different types of
requests and corresponding grants, the requirement is that for each type, if the
request event happens infinitely often, then the corresponding grant event must
also happen infinitely often. All omega-regular objectives can be expressed as
Streett objectives and hence they are canonical in verification. Consider graphs/MDPs
with n vertices, m edges, and a Streett objectives with k pairs, and let b denote
the size of the description of the Streett objective for the sets of requests
and grants. The current best-known algorithm for the problem requires time O(min(n^2,
m sqrt{m log n}) + b log n). In this work we present randomized near-linear time
algorithms, with expected running time O~(m + b), where the O~ notation hides
poly-log factors. Our randomized algorithms are near-linear in the size of the
input, and hence optimal up to poly-log factors. '
alternative_title:
- LIPIcs
article_number: '7'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger M, Svozil A. Near-linear time algorithms
for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings
in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.7'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2019). Near-linear
time algorithms for Streett objectives in graphs and MDPs. In Leibniz International
Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander
Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”
In Leibniz International Proceedings in Informatics, Vol. 140. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.
ieee: K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Near-linear time algorithms
for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings
in Informatics, Amsterdam, Netherlands, 2019, vol. 140.
ista: 'Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2019. Near-linear time algorithms
for Streett objectives in graphs and MDPs. Leibniz International Proceedings in
Informatics. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 7.'
mla: Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives
in Graphs and MDPs.” Leibniz International Proceedings in Informatics,
vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.
short: K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, Leibniz International
Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2019-08-27
corr_author: '1'
date_created: 2019-09-18T08:07:58Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-07-10T11:53:59Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.7
ec_funded: 1
file:
- access_level: open_access
checksum: e1f0e4061212454574f34a1368d018ec
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T08:20:30Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6922'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 730112
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Near-linear time algorithms for Streett objectives in graphs and MDPs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2019'
...
---
_id: '6889'
abstract:
- lang: eng
text: 'We study Markov decision processes and turn-based stochastic games with parity
conditions. There are three qualitative winning criteria, namely, sure winning,
which requires all paths to satisfy the condition, almost-sure winning, which
requires the condition to be satisfied with probability 1, and limit-sure winning,
which requires the condition to be satisfied with probability arbitrarily close
to 1. We study the combination of two of these criteria for parity conditions,
e.g., there are two parity conditions one of which must be won surely, and the
other almost-surely. The problem has been studied recently by Berthon et al. for
MDPs with combination of sure and almost-sure winning, under infinite-memory strategies,
and the problem has been established to be in NP cap co-NP. Even in MDPs there
is a difference between finite-memory and infinite-memory strategies. Our main
results for combination of sure and almost-sure winning are as follows: (a) we
show that for MDPs with finite-memory strategies the problem is in NP cap co-NP;
(b) we show that for turn-based stochastic games the problem is co-NP-complete,
both for finite-memory and infinite-memory strategies; and (c) we present algorithmic
results for the finite-memory case, both for MDPs and turn-based stochastic games,
by reduction to non-stochastic parity games. In addition we show that all the
above complexity results also carry over to combination of sure and limit-sure
winning, and results for all other combinations can be derived from existing results
in the literature. Thus we present a complete picture for the study of combinations
of two qualitative winning criteria for parity conditions in MDPs and turn-based
stochastic games. '
alternative_title:
- LIPIcs
article_number: '6'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: 'Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic
Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.6'
apa: 'Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning
for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: Conference on
Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6'
chicago: Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative
Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.
ieee: 'K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic
Parity Games,” presented at the CONCUR: Conference on Concurrency Theory, Amsterdam,
Netherlands, 2019, vol. 140.'
ista: 'Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic
Parity Games. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 6.'
mla: Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning
for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.
short: K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:11:43Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-07-10T11:53:59Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.6
file:
- access_level: open_access
checksum: 7b2ecfd4d9d02360308c0ca986fc10a7
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T08:49:45Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6923'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 509163
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Combinations of Qualitative Winning for Stochastic Parity Games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2019'
...
---
_id: '6942'
abstract:
- lang: eng
text: "Graph games and Markov decision processes (MDPs) are standard models in reactive
synthesis and verification of probabilistic systems with nondeterminism. The class
of \U0001D714 -regular winning conditions; e.g., safety, reachability, liveness,
parity conditions; provides a robust and expressive specification formalism for
properties that arise in analysis of reactive systems. The resolutions of nondeterminism
in games and MDPs are represented as strategies, and we consider succinct representation
of such strategies. The decision-tree data structure from machine learning retains
the flavor of decisions of strategies and allows entropy-based minimization to
obtain succinct trees. However, in contrast to traditional machine-learning problems
where small errors are allowed, for winning strategies in graph games and MDPs
no error is allowed, and the decision tree must represent the entire strategy.
In this work we propose decision trees with linear classifiers for representation
of strategies in graph games and MDPs. We have implemented strategy representation
using this data structure and we present experimental results for problems on
graph games and MDPs, which show that this new data structure presents a much
more efficient strategy representation as compared to standard decision trees."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Pranav
full_name: Ashok, Pranav
last_name: Ashok
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jan
full_name: Křetínský, Jan
last_name: Křetínský
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. Strategy
representation by decision trees with linear classifiers. In: 16th International
Conference on Quantitative Evaluation of Systems. Vol 11785. Springer Nature;
2019:109-128. doi:10.1007/978-3-030-30281-8_7'
apa: 'Ashok, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., &
Toman, V. (2019). Strategy representation by decision trees with linear classifiers.
In 16th International Conference on Quantitative Evaluation of Systems
(Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-30281-8_7'
chicago: Ashok, Pranav, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph
Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear
Classifiers.” In 16th International Conference on Quantitative Evaluation of
Systems, 11785:109–28. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-30281-8_7.
ieee: P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman,
“Strategy representation by decision trees with linear classifiers,” in 16th
International Conference on Quantitative Evaluation of Systems, Glasgow, United
Kingdom, 2019, vol. 11785, pp. 109–128.
ista: 'Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. 2019.
Strategy representation by decision trees with linear classifiers. 16th International
Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation
of Systems, LNCS, vol. 11785, 109–128.'
mla: Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear
Classifiers.” 16th International Conference on Quantitative Evaluation of Systems,
vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7.
short: P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, V. Toman,
in:, 16th International Conference on Quantitative Evaluation of Systems, Springer
Nature, 2019, pp. 109–128.
conference:
end_date: 2019-09-12
location: Glasgow, United Kingdom
name: 'QEST: Quantitative Evaluation of Systems'
start_date: 2019-09-10
date_created: 2019-10-14T06:57:49Z
date_published: 2019-09-04T00:00:00Z
date_updated: 2025-04-14T13:51:05Z
day: '04'
department:
- _id: KrCh
- _id: ChLa
doi: 10.1007/978-3-030-30281-8_7
external_id:
arxiv:
- '1906.08178'
isi:
- '000679281300007'
intvolume: ' 11785'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1906.08178
month: '09'
oa: 1
oa_version: Preprint
page: 109-128
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: 16th International Conference on Quantitative Evaluation of Systems
publication_identifier:
eisbn:
- '9783030302818'
isbn:
- '9783030302801'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategy representation by decision trees with linear classifiers
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11785
year: '2019'
...