Guy Avni

Henzinger_Thomas Group

25 Publications

Mark all

[25]
2023 | Published | Conference Paper | IST-REx-ID: 14243 | OA
Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[24]
2023 | Published | Conference Paper | IST-REx-ID: 14518 | OA
Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. 2023. Reachability poorman discrete-bidding games. Frontiers in Artificial Intelligence and Applications. ECAI: European Conference on Artificial Intelligence vol. 372, 141–148.
[Published Version] View | Files available | DOI | arXiv
 
[23]
2022 | Published | Conference Paper | IST-REx-ID: 12509 | OA
Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer ScienceLeibniz International Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6.
[Published Version] View | Files available | DOI
 
[22]
2021 | Published | Journal Article | IST-REx-ID: 9239 | OA
Avni G, Henzinger TA, Žikelić Đ. 2021. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 119(8), 133–144.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[21]
2021 | Published | Journal Article | IST-REx-ID: 10674 | OA
Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[20]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2020 | Published | Conference Paper | IST-REx-ID: 8599 | OA
Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 2.
[Published Version] View | Files available | DOI
 
[18]
2020 | Published | Conference Paper | IST-REx-ID: 9040 | OA
Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.
[Published Version] View | Files available | DOI
 
[17]
2020 | Published | Journal Article | IST-REx-ID: 6761 | OA
Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.
[Submitted Version] View | Files available | DOI | WoS
 
[16]
2020 | Published | Journal Article | IST-REx-ID: 9197
Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.
[Preprint] View | DOI | arXiv
 
[15]
2019 | Published | Conference Paper | IST-REx-ID: 6462 | OA
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561, 630–649.
[Published Version] View | Files available | DOI | WoS
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 6752 | OA
Avni G, Henzinger TA, Chonev VK. 2019. Infinite-duration bidding games. Journal of the ACM. 66(4), 31.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2019 | Published | Conference Paper | IST-REx-ID: 6822 | OA
Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.
[Submitted Version] View | Files available | DOI
 
[12]
2019 | Published | Conference Paper | IST-REx-ID: 6884 | OA
Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2019 | Published | Conference Paper | IST-REx-ID: 6886 | OA
Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.
[Published Version] View | Files available | DOI | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.
[Published Version] View | Files available | DOI
 
[8]
2018 | Published | Journal Article | IST-REx-ID: 6006 | OA
Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.
[Published Version] View | Files available | DOI
 
[7]
2018 | Published | Journal Article | IST-REx-ID: 608 | OA
Avni G, Kupferman O. 2018. Synthesis from component libraries with costs. Theoretical Computer Science. 712, 50–72.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[6]
2017 | Published | Conference Paper | IST-REx-ID: 1116 | OA
Avni G, Goel S, Henzinger TA, Rodríguez Navas G. 2017. Computing scores of forwarding schemes in switched networks with probabilistic faults. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10206, 169–187.
[Submitted Version] View | Files available | DOI | WoS
 
[5]
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR: Concurrency Theory, LIPIcs, vol. 85, 17.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 37.
[Published Version] View | Files available | DOI
 
[3]
2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology for reasoning about network games. IJCAI: International Joint Conference on Artificial Intelligence , 70–76.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1341 | OA
Avni G, Henzinger TA, Kupferman O. 2016. Dynamic resource allocation games. SAGT: Symposium on Algorithmic Game Theory, LNCS, vol. 9928, 153–166.
[Preprint] View | Files available | DOI
 
[1]
2016 | Published | Conference Paper | IST-REx-ID: 1135 | OA
Avni G, Guha S, Rodríguez Navas G. 2016. Synthesizing time triggered schedules for switched networks with faulty links. Proceedings of the 13th International Conference on Embedded Software . EMSOFT: Embedded Software , 26.
[Submitted Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

1 Grants


Formal Methods meets Algorithmic Game Theory

2018-02-01 – 2020-01-31
FWF

25 Publications

Mark all

[25]
2023 | Published | Conference Paper | IST-REx-ID: 14243 | OA
Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[24]
2023 | Published | Conference Paper | IST-REx-ID: 14518 | OA
Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. 2023. Reachability poorman discrete-bidding games. Frontiers in Artificial Intelligence and Applications. ECAI: European Conference on Artificial Intelligence vol. 372, 141–148.
[Published Version] View | Files available | DOI | arXiv
 
[23]
2022 | Published | Conference Paper | IST-REx-ID: 12509 | OA
Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer ScienceLeibniz International Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6.
[Published Version] View | Files available | DOI
 
[22]
2021 | Published | Journal Article | IST-REx-ID: 9239 | OA
Avni G, Henzinger TA, Žikelić Đ. 2021. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 119(8), 133–144.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[21]
2021 | Published | Journal Article | IST-REx-ID: 10674 | OA
Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[20]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2020 | Published | Conference Paper | IST-REx-ID: 8599 | OA
Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 2.
[Published Version] View | Files available | DOI
 
[18]
2020 | Published | Conference Paper | IST-REx-ID: 9040 | OA
Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.
[Published Version] View | Files available | DOI
 
[17]
2020 | Published | Journal Article | IST-REx-ID: 6761 | OA
Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.
[Submitted Version] View | Files available | DOI | WoS
 
[16]
2020 | Published | Journal Article | IST-REx-ID: 9197
Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.
[Preprint] View | DOI | arXiv
 
[15]
2019 | Published | Conference Paper | IST-REx-ID: 6462 | OA
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561, 630–649.
[Published Version] View | Files available | DOI | WoS
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 6752 | OA
Avni G, Henzinger TA, Chonev VK. 2019. Infinite-duration bidding games. Journal of the ACM. 66(4), 31.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[13]
2019 | Published | Conference Paper | IST-REx-ID: 6822 | OA
Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.
[Submitted Version] View | Files available | DOI
 
[12]
2019 | Published | Conference Paper | IST-REx-ID: 6884 | OA
Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.
[Published Version] View | Files available | DOI | arXiv
 
[11]
2019 | Published | Conference Paper | IST-REx-ID: 6886 | OA
Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.
[Published Version] View | Files available | DOI | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.
[Published Version] View | Files available | DOI
 
[8]
2018 | Published | Journal Article | IST-REx-ID: 6006 | OA
Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.
[Published Version] View | Files available | DOI
 
[7]
2018 | Published | Journal Article | IST-REx-ID: 608 | OA
Avni G, Kupferman O. 2018. Synthesis from component libraries with costs. Theoretical Computer Science. 712, 50–72.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[6]
2017 | Published | Conference Paper | IST-REx-ID: 1116 | OA
Avni G, Goel S, Henzinger TA, Rodríguez Navas G. 2017. Computing scores of forwarding schemes in switched networks with probabilistic faults. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10206, 169–187.
[Submitted Version] View | Files available | DOI | WoS
 
[5]
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR: Concurrency Theory, LIPIcs, vol. 85, 17.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 37.
[Published Version] View | Files available | DOI
 
[3]
2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology for reasoning about network games. IJCAI: International Joint Conference on Artificial Intelligence , 70–76.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1341 | OA
Avni G, Henzinger TA, Kupferman O. 2016. Dynamic resource allocation games. SAGT: Symposium on Algorithmic Game Theory, LNCS, vol. 9928, 153–166.
[Preprint] View | Files available | DOI
 
[1]
2016 | Published | Conference Paper | IST-REx-ID: 1135 | OA
Avni G, Guha S, Rodríguez Navas G. 2016. Synthesizing time triggered schedules for switched networks with faulty links. Proceedings of the 13th International Conference on Embedded Software . EMSOFT: Embedded Software , 26.
[Submitted Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed