Avni, G., Jecker, I. R., &; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 5464–5471). Washington, DC, United States.https://doi.org/10.1609/aaai.v37i5.25679 
LibreCat: https://research-explorer.ista.ac.at/record/14243
DOI: 10.1609/aaai.v37i5.25679
arXiv: 2211.13626

Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., &; Zikelic, D. (2023). Reachability poorman discrete-bidding games. In Frontiers in Artificial Intelligence and Applications (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press.https://doi.org/10.3233/FAIA230264 
LibreCat: https://research-explorer.ista.ac.at/record/14518
DOI: 10.3233/FAIA230264
arXiv: 2307.15218

Avni, G., &; Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2022.3 
LibreCat: https://research-explorer.ista.ac.at/record/12509
DOI: 10.4230/LIPIcs.MFCS.2022.3

Avni, G., Jecker, I. R., &; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611976465.38 
LibreCat: https://research-explorer.ista.ac.at/record/10694
DOI: 10.1137/1.9781611976465.38
arXiv: 2005.06636

Avni, G., Henzinger, T. A., &; dikeli, . (2021). Bidding mechanisms in graph games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2021.02.008 
LibreCat: https://research-explorer.ista.ac.at/record/9239
DOI: 10.1016/j.jcss.2021.02.008
WoS: 000634149800009
arXiv: 1905.03835

Aghajohari, M., Avni, G., &; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. International Federation for Computational Logic.https://doi.org/10.23638/LMCS-17(1:10)2021 
LibreCat: https://research-explorer.ista.ac.at/record/10674
DOI: 10.23638/LMCS-17(1:10)2021
WoS: 000658724600010
arXiv: 1905.03588

Avni, G., &; Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.2 
LibreCat: https://research-explorer.ista.ac.at/record/8599
DOI: 10.4230/LIPIcs.CONCUR.2020.2

Alamdari, P. A., Avni, G., Henzinger, T. A., &; Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press.https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21 
LibreCat: https://research-explorer.ista.ac.at/record/9040
DOI: 10.34727/2020/isbn.978-3-85448-042-6_21

Avni, G., Henzinger, T. A., &; Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2019.06.031 
LibreCat: https://research-explorer.ista.ac.at/record/6761
DOI: 10.1016/j.tcs.2019.06.031
WoS: 000512219400004

Avni, G., Ibsen-Jensen, R., &; Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v34i02.5546 
LibreCat: https://research-explorer.ista.ac.at/record/9197
DOI: 10.1609/aaai.v34i02.5546
arXiv: 1911.08360

Avni, G., Henzinger, T. A., Ibsen-Jensen, R., &; Novotny, P. (2019). Bidding games on Markov decision processes. In https://doi.org/10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer.https://doi.org/10.1007/978-3-030-30806-3_1 
LibreCat: https://research-explorer.ista.ac.at/record/6822
DOI: 10.1007/978-3-030-30806-3_1

Aghajohari, M., Avni, G., &; Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.20 
LibreCat: https://research-explorer.ista.ac.at/record/6886
DOI: 10.4230/LIPICS.CONCUR.2019.20
arXiv: 1905.03588

Avni, G., Henzinger, T. A., &; Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2019.11 
LibreCat: https://research-explorer.ista.ac.at/record/6884
DOI: 10.4230/LIPICS.MFCS.2019.11
arXiv: 1905.03835

Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., &; Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer.https://doi.org/10.1007/978-3-030-25540-4_36 
LibreCat: https://research-explorer.ista.ac.at/record/6462
DOI: 10.1007/978-3-030-25540-4_36
WoS: 000491468000036

Avni, G., Henzinger, T. A., &; Chonev, V. K. (2019). Infinite-duration bidding games. Journal of the ACM. ACM.https://doi.org/10.1145/3340295 
LibreCat: https://research-explorer.ista.ac.at/record/6752
DOI: 10.1145/3340295
WoS: 000487714900008
arXiv: 1705.01433

Avni, G., Guha, S., &; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2018.23 
LibreCat: https://research-explorer.ista.ac.at/record/6005
DOI: 10.4230/LIPICS.MFCS.2018.23

Avni, G., Henzinger, T. A., &; Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer.https://doi.org/10.1007/978-3-030-04612-5_2 
LibreCat: https://research-explorer.ista.ac.at/record/5788
DOI: 10.1007/978-3-030-04612-5_2
WoS: 000865933000002
arXiv: 1804.04372

Avni, G., &; Kupferman, O. (2018). Synthesis from component libraries with costs. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2017.11.001 
LibreCat: https://research-explorer.ista.ac.at/record/608
DOI: 10.1016/j.tcs.2017.11.001
WoS: 000424959200003

Avni, G., Guha, S., &; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. Games. MDPI AG.https://doi.org/10.3390/g9030039 
LibreCat: https://research-explorer.ista.ac.at/record/6006
DOI: 10.3390/g9030039

Avni, G., Guha, S., &; Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2017.37 
LibreCat: https://research-explorer.ista.ac.at/record/963
DOI: 10.4230/LIPIcs.MFCS.2017.37

Avni, G., Henzinger, T. A., &; Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2017.21 
LibreCat: https://research-explorer.ista.ac.at/record/950
DOI: 10.4230/LIPIcs.CONCUR.2017.21
arXiv: 1705.01433

Avni, G., Goel, S., Henzinger, T. A., &; Rodríguez Navas, G. (2017). Computing scores of forwarding schemes in switched networks with probabilistic faults (Vol. 10206, pp. 169–187). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54580-5_10 
LibreCat: https://research-explorer.ista.ac.at/record/1116
DOI: 10.1007/978-3-662-54580-5_10
WoS: 000440733400010

Avni, G., Guha, S., &; Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press.https://doi.org/10.24963/ijcai.2017/11 
LibreCat: https://research-explorer.ista.ac.at/record/1003
DOI: 10.24963/ijcai.2017/11
WoS: 000764137500011

Avni, G., Guha, S., &; Rodríguez Navas, G. (2016). Synthesizing time triggered schedules for switched networks with faulty links. In Proceedings of the 13th International Conference on Embedded Software . Pittsburgh, PA, USA: ACM.https://doi.org/10.1145/2968478.2968499 
LibreCat: https://research-explorer.ista.ac.at/record/1135
DOI: 10.1145/2968478.2968499

Avni, G., Henzinger, T. A., &; Kupferman, O. (2016). Dynamic resource allocation games (Vol. 9928, pp. 153–166). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53354-3_13 
LibreCat: https://research-explorer.ista.ac.at/record/1341
DOI: 10.1007/978-3-662-53354-3_13