DOI,IST REx ID,Research Group,Title of publication
10.1609/aaai.v37i5.25679,14243,"ToHe,KrCh",Bidding graph games with partially-observable budgets
10.3233/FAIA230264,14518,"ToHe,KrCh",Reachability poorman discrete-bidding games
10.4230/LIPIcs.MFCS.2022.3,12509,ToHe,An updated survey of bidding games on graphs
10.1016/j.jcss.2021.02.008,9239,ToHe,Bidding mechanisms in graph games
10.23638/LMCS-17(1:10)2021,10674,ToHe,Determinacy in discrete-bidding infinite-duration games
10.1137/1.9781611976465.38,10694,"GradSch,KrCh",Infinite-duration all-pay bidding games
10.4230/LIPIcs.CONCUR.2020.2,8599,ToHe,A survey of bidding games on graphs
10.34727/2020/isbn.978-3-85448-042-6_21,9040,ToHe,Formal methods with a touch of magic
10.1609/aaai.v34i02.5546,9197,"ToHe,KrCh",All-pay bidding games on graphs
10.1016/j.tcs.2019.06.031,6761,ToHe,Dynamic resource allocation games
10.1007/978-3-030-25540-4_36,6462,"ToHe,KrCh",Run-time optimization for learned controllers through quantitative games
10.1145/3340295,6752,ToHe,Infinite-duration bidding games
10.1007/978-3-030-30806-3_1,6822,ToHe,Bidding games on Markov decision processes
10.4230/LIPICS.MFCS.2019.11,6884,"ToHe,KrCh",Bidding mechanisms in graph games
10.4230/LIPICS.CONCUR.2019.20,6886,ToHe,Determinacy in discrete-bidding infinite-duration games
10.1007/978-3-030-04612-5_2,5788,ToHe,Infinite-duration poorman-bidding games
10.4230/LIPICS.MFCS.2018.23,6005,ToHe,Timed network games with clocks
10.3390/g9030039,6006,ToHe,An abstraction-refinement methodology for reasoning about network games
10.1016/j.tcs.2017.11.001,608,ToHe,Synthesis from component libraries with costs
10.24963/ijcai.2017/11,1003,ToHe,An abstraction-refinement methodology for reasoning about network games