_id,doi,title
13967,10.1109/LICS56636.2023.10175771,Stopping criteria for value iteration on stochastic games with quantitative objectives
14242,10.1609/aaai.v37i12.26747,Quantization-aware interval bound propagation for training certifiably robust quantized neural networks
14243,10.1609/aaai.v37i5.25679,Bidding graph games with partially-observable budgets
14259,10.1007/978-3-031-37706-8_20,"Guessing winning policies in LTL synthesis by semantic learning"
12676,10.1137/1.9781611977554.ch173,Faster algorithm for turn-based stochastic games with bounded treewidth
12706,10.1371/journal.pone.0279838,Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations
12738,10.1007/s10703-023-00411-4,Stochastic games with lexicographic objectives
12787,10.1098/rspa.2022.0685,Coexistence times in the Moran process with environmental heterogeneity
12833,10.46298/DMTCS.8383,Token swapping on trees
12861,10.1038/s41467-023-37817-x,Quantitative assessment can stabilize indirect reciprocity under imperfect information
10731,10.1038/s41598-022-05333-5,Infection dynamics of COVID-19 virus under lockdown and reopening
11402,10.1016/j.jcss.2022.04.003,Graph planning with expected finite horizon
11459,10.1145/3519939.3523435,Differential cost analysis with simultaneous potentials and anti-potentials
14600,10.48550/ARXIV.2210.05308,Learning control policies for stochastic systems with reach-avoid guarantees
14601,10.48550/arXiv.2205.11991,Learning stabilizing policies in stochastic control systems
9311,10.1287/moor.2020.1116,Finite-memory strategies in POMDPs with long-run average objectives
10602,10.1007/s00236-021-00412-y,Index appearance record with preorders
11938,10.7155/jgaa.00591,On compatible matchings
12000,10.1007/978-3-031-13185-1_4,"Sound and complete certificates for auantitative termination analysis of probabilistic programs"
12101,10.4230/LIPIcs.FSTTCS.2022.11,Complexity of spatial games