Guy Avni

Henzinger_Thomas Group

27 Publications

Mark all

[27]
2024 | Published | Conference Paper | IST-REx-ID: 15376 | OA
G. Avni, K. Mallik, and S. Sadhukhan, “Auction-based scheduling,” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 153–172.
[Published Version] View | Files available | DOI | arXiv
 
[26]
2024 | Published | Conference Paper | IST-REx-ID: 18066 | OA
G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games with charging,” in 35th International Conference on Concurrency Theory, Calgary, Canada, 2024, vol. 311.
[Published Version] View | Files available | DOI | arXiv
 
[25]
2023 | Published | Conference Paper | IST-REx-ID: 14243 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[24]
2023 | Published | Conference Paper | IST-REx-ID: 14518 | OA
G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in Frontiers in Artificial Intelligence and Applications, Krakow, Poland, 2023, vol. 372, pp. 141–148.
[Published Version] View | Files available | DOI | arXiv
 
[23]
2022 | Published | Conference Paper | IST-REx-ID: 12509 | OA
G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.
[Published Version] View | Files available | DOI
 
[22]
2021 | Published | Journal Article | IST-REx-ID: 10674 | OA
M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” Logical Methods in Computer Science, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[21]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2021 | Published | Journal Article | IST-REx-ID: 9239 | OA
G. Avni, T. A. Henzinger, and Đ. Žikelić, “Bidding mechanisms in graph games,” Journal of Computer and System Sciences, vol. 119, no. 8. Elsevier, pp. 133–144, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[19]
2020 | Published | Conference Paper | IST-REx-ID: 8599 | OA
G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.
[Published Version] View | Files available | DOI
 
[18]
2020 | Published | Conference Paper | IST-REx-ID: 9040 | OA
P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147.
[Published Version] View | Files available | DOI
 
[17]
2020 | Published | Journal Article | IST-REx-ID: 9197
G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.
[Preprint] View | DOI | arXiv
 
[16]
2020 | Published | Journal Article | IST-REx-ID: 6761 | OA
G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.
[Submitted Version] View | Files available | DOI | WoS
 
[15]
2019 | Published | Conference Paper | IST-REx-ID: 6462 | OA
G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in 31st International Conference on Computer-Aided Verification, New York, NY, United States, 2019, vol. 11561, pp. 630–649.
[Published Version] View | Files available | DOI | WoS
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 6752 | OA
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” Journal of the ACM, vol. 66, no. 4. ACM, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2019 | Published | Conference Paper | IST-REx-ID: 6822 | OA
G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.
[Submitted Version] View | Files available | DOI
 
[12]
2019 | Published | Conference Paper | IST-REx-ID: 6884 | OA
G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2019 | Published | Conference Paper | IST-REx-ID: 6886 | OA
M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
[Published Version] View | Files available | DOI | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.
[Published Version] View | Files available | DOI
 
[8]
2018 | Published | Journal Article | IST-REx-ID: 608 | OA
G. Avni and O. Kupferman, “Synthesis from component libraries with costs,” Theoretical Computer Science, vol. 712. Elsevier, pp. 50–72, 2018.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[7]
2018 | Published | Journal Article | IST-REx-ID: 6006 | OA
G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” Games, vol. 9, no. 3. MDPI, 2018.
[Published Version] View | Files available | DOI
 
[6]
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 1116 | OA
G. Avni, S. Goel, T. A. Henzinger, and G. Rodríguez Navas, “Computing scores of forwarding schemes in switched networks with probabilistic faults,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10206, pp. 169–187.
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1341 | OA
G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 153–166.
[Preprint] View | Files available | DOI
 
[1]
2016 | Published | Conference Paper | IST-REx-ID: 1135 | OA
G. Avni, S. Guha, and G. Rodríguez Navas, “Synthesizing time triggered schedules for switched networks with faulty links,” in Proceedings of the 13th International Conference on Embedded Software , Pittsburgh, PA, USA, 2016.
[Submitted Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

Grants


27 Publications

Mark all

[27]
2024 | Published | Conference Paper | IST-REx-ID: 15376 | OA
G. Avni, K. Mallik, and S. Sadhukhan, “Auction-based scheduling,” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 153–172.
[Published Version] View | Files available | DOI | arXiv
 
[26]
2024 | Published | Conference Paper | IST-REx-ID: 18066 | OA
G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games with charging,” in 35th International Conference on Concurrency Theory, Calgary, Canada, 2024, vol. 311.
[Published Version] View | Files available | DOI | arXiv
 
[25]
2023 | Published | Conference Paper | IST-REx-ID: 14243 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[24]
2023 | Published | Conference Paper | IST-REx-ID: 14518 | OA
G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in Frontiers in Artificial Intelligence and Applications, Krakow, Poland, 2023, vol. 372, pp. 141–148.
[Published Version] View | Files available | DOI | arXiv
 
[23]
2022 | Published | Conference Paper | IST-REx-ID: 12509 | OA
G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.
[Published Version] View | Files available | DOI
 
[22]
2021 | Published | Journal Article | IST-REx-ID: 10674 | OA
M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” Logical Methods in Computer Science, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[21]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2021 | Published | Journal Article | IST-REx-ID: 9239 | OA
G. Avni, T. A. Henzinger, and Đ. Žikelić, “Bidding mechanisms in graph games,” Journal of Computer and System Sciences, vol. 119, no. 8. Elsevier, pp. 133–144, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[19]
2020 | Published | Conference Paper | IST-REx-ID: 8599 | OA
G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.
[Published Version] View | Files available | DOI
 
[18]
2020 | Published | Conference Paper | IST-REx-ID: 9040 | OA
P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147.
[Published Version] View | Files available | DOI
 
[17]
2020 | Published | Journal Article | IST-REx-ID: 9197
G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.
[Preprint] View | DOI | arXiv
 
[16]
2020 | Published | Journal Article | IST-REx-ID: 6761 | OA
G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.
[Submitted Version] View | Files available | DOI | WoS
 
[15]
2019 | Published | Conference Paper | IST-REx-ID: 6462 | OA
G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in 31st International Conference on Computer-Aided Verification, New York, NY, United States, 2019, vol. 11561, pp. 630–649.
[Published Version] View | Files available | DOI | WoS
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 6752 | OA
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” Journal of the ACM, vol. 66, no. 4. ACM, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2019 | Published | Conference Paper | IST-REx-ID: 6822 | OA
G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.
[Submitted Version] View | Files available | DOI
 
[12]
2019 | Published | Conference Paper | IST-REx-ID: 6884 | OA
G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2019 | Published | Conference Paper | IST-REx-ID: 6886 | OA
M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
[Published Version] View | Files available | DOI | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.
[Published Version] View | Files available | DOI
 
[8]
2018 | Published | Journal Article | IST-REx-ID: 608 | OA
G. Avni and O. Kupferman, “Synthesis from component libraries with costs,” Theoretical Computer Science, vol. 712. Elsevier, pp. 50–72, 2018.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[7]
2018 | Published | Journal Article | IST-REx-ID: 6006 | OA
G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” Games, vol. 9, no. 3. MDPI, 2018.
[Published Version] View | Files available | DOI
 
[6]
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 1116 | OA
G. Avni, S. Goel, T. A. Henzinger, and G. Rodríguez Navas, “Computing scores of forwarding schemes in switched networks with probabilistic faults,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10206, pp. 169–187.
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1341 | OA
G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 153–166.
[Preprint] View | Files available | DOI
 
[1]
2016 | Published | Conference Paper | IST-REx-ID: 1135 | OA
G. Avni, S. Guha, and G. Rodríguez Navas, “Synthesizing time triggered schedules for switched networks with faulty links,” in Proceedings of the 13th International Conference on Embedded Software , Pittsburgh, PA, USA, 2016.
[Submitted Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed