Symbolic algorithms for graphs and Markov decision processes with fairness objectives
K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.
LibreCat: https://research-explorer.ista.ac.at/record/141
DOI: 10.1007/978-3-319-96142-2_13
WoS: 000491469700013

The signal-burying game can explain why we obscure positive traits and good deeds
M. Hoffman, C. Hilbe, M. Nowak, Nature Human Behaviour 2 (2018) 397–404.
LibreCat: https://research-explorer.ista.ac.at/record/293
DOI: 10.1038/s41562-018-0354-z
WoS: 000435551300009

The Big Match with a clock and a bit of memory
K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–150.
LibreCat: https://research-explorer.ista.ac.at/record/5967
DOI: 10.1145/3219166.3219198
WoS: 000492755100020

Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/5993
DOI: 10.1145/3174800
WoS: 000434634500003
arXiv: 1510.08517

Goal-HSVI: Heuristic search value iteration for goal-POMDPs
K. Horák, B. Bosanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.
LibreCat: https://research-explorer.ista.ac.at/record/25
DOI: 10.24963/ijcai.2018/662
WoS: 000764175404127

Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives
K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.
LibreCat: https://research-explorer.ista.ac.at/record/24
DOI: 10.24963/ijcai.2018/652
WoS: 000764175404117
arXiv: 1804.10601

Sensor synthesis for POMDPs with reachability objectives
K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.
LibreCat: https://research-explorer.ista.ac.at/record/34
WoS: 000492986200006
arXiv: 1710.00675

Algorithms and conditional lower bounds for planning problems
K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/35
WoS: 000492986200007
arXiv: 1804.07031

Automated competitive analysis of real time scheduling with graph games
K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.
LibreCat: https://research-explorer.ista.ac.at/record/738
DOI: 10.1007/s11241-017-9293-4
WoS: 000419955500006

Language acquisition with communication between learners
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/198
DOI: 10.1098/rsif.2018.0073
WoS: 000428576200023
PMID: 29593089

Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/5751
DOI: 10.1038/s42003-018-0078-7
WoS: 000461126500071

Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/66
DOI: 10.4230/LIPIcs.CONCUR.2018.11
arXiv: 1806.03108

Quantitative analysis of smart contracts
K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.
LibreCat: https://research-explorer.ista.ac.at/record/311
DOI: 10.1007/978-3-319-89884-1_26

Secure Credit Reporting on the Blockchain
A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.
LibreCat: https://research-explorer.ista.ac.at/record/6340
DOI: 10.1109/Cybermatics_2018.2018.00231
WoS: 000481634500196
arXiv: 1805.09104

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/6009
DOI: 10.1145/3210257
WoS: 000444694800001
arXiv: 1510.07565

Computational approaches for stochastic shortest path on succinct MDPs
K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707.
LibreCat: https://research-explorer.ista.ac.at/record/5977
DOI: 10.24963/ijcai.2018/653
WoS: 000764175404118
arXiv: 1804.08984

Indirect reciprocity with private, noisy, and incomplete information
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, M. Nowak, PNAS 115 (2018) 12241–12246.
LibreCat: https://research-explorer.ista.ac.at/record/2
DOI: 10.1073/pnas.1810565115
WoS: 000451351000063
PMID: 30429320

A new proof rule for almost-sure termination
A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).
LibreCat: https://research-explorer.ista.ac.at/record/10418
DOI: 10.1145/3158121
arXiv: 1711.03588

Improved algorithms for parity and Streett objectives
K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).
LibreCat: https://research-explorer.ista.ac.at/record/464
DOI: 10.23638/LMCS-13(3:26)2017
arXiv: 1410.0833

Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Ketínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).
LibreCat: https://research-explorer.ista.ac.at/record/466
DOI: 10.23638/LMCS-13(2:15)2017