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