_id,doi,title
12102,10.4230/LIPIcs.FSTTCS.2022.29,Algorithms and hardness results for computing cores of Markov chains
12170,10.1007/978-3-031-19992-9_20,"PET – A partial exploration tool for probabilistic verification"
12257,10.1103/physreve.106.034321,Social balance on networks: Local minima and best-edge dynamics
12280,10.1371/journal.pcbi.1010149,Direct reciprocity between individuals that use different strategy spaces
12511,10.1609/aaai.v36i7.20695,Stability verification in stochastic control systems via neural network supermartingales
12568,10.1609/aaai.v36i9.21222,Risk-aware stochastic shortest path
12677,10.48550/ARXIV.2209.14368,Repeated prophet inequality with near-optimal bounds
12775,10.4230/LIPIcs.CONCUR.2022.11,Anytime guarantees for reachability in uncountable Markov decision processes
10667,10.48550/arXiv.2111.03165,Infinite time horizon safety of Bayesian neural networks
10694,10.1137/1.9781611976465.38,Infinite-duration all-pay bidding games
10847,10.24963/ijcai.2021/575,Solving partially observable stochastic shortest-path games
8793,10.1016/j.dam.2020.10.022,Optimal strategies for selecting coordinators
8934,10.15479/AT:ISTA:8934,Parameterized and algebro-geometric advances in static program analysis
9293,10.1016/j.artint.2021.103499,Algorithms and conditional lower bounds for planning problems
9296,10.1007/978-3-030-68211-8_18,On compatible matchings
9381,10.1371/journal.pcbi.1008523,Mistakes can stabilise the dynamics of rock-paper-scissors games
9393,10.1007/s10703-021-00373-5,Faster algorithms for quantitative verification in bounded treewidth graphs
9402,10.1038/s41562-021-01114-8,A unified framework of direct and indirect reciprocity
9403,,The evolution of strategic ignorance in strategic interaction
9640,10.1038/s41467-021-24271-w,Fast and strong amplifiers of natural selection