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. Bidding graph games with partially-observable budgets. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. ; 2023:5464-5471. doi:10.1609/aaai.v37i5.25679
[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. Reachability poorman discrete-bidding games. In: Frontiers in Artificial Intelligence and Applications. Vol 372. IOS Press; 2023:141-148. doi:10.3233/FAIA230264
[Published Version] View | Files available | DOI | arXiv
 
[23]
2022 | Published | Conference Paper | IST-REx-ID: 12509 | OA
Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3
[Published Version] View | Files available | DOI
 
[22]
2021 | Published | Journal Article | IST-REx-ID: 9239 | OA
Avni G, Henzinger TA, Žikelić Đ. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 2021;119(8):133-144. doi:10.1016/j.jcss.2021.02.008
[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. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 2021;17(1):10:1-10:23. doi:10.23638/LMCS-17(1:10)2021
[Published Version] View | Files available | DOI | WoS | arXiv
 
[20]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:617-636. doi:10.1137/1.9781611976465.38
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2020 | Published | Conference Paper | IST-REx-ID: 8599 | OA
Avni G, Henzinger TA. A survey of bidding games on graphs. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.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. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21
[Published Version] View | Files available | DOI
 
[17]
2020 | Published | Journal Article | IST-REx-ID: 6761 | OA
Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031
[Submitted Version] View | Files available | DOI | WoS
 
[16]
2020 | Published | Journal Article | IST-REx-ID: 9197
Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546
[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. Run-time optimization for learned controllers through quantitative games. In: 31st International Conference on Computer-Aided Verification. Vol 11561. Springer; 2019:630-649. doi:10.1007/978-3-030-25540-4_36
[Published Version] View | Files available | DOI | WoS
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 6752 | OA
Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. Journal of the ACM. 2019;66(4). doi:10.1145/3340295
[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. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1
[Submitted Version] View | Files available | DOI
 
[12]
2019 | Published | Conference Paper | IST-REx-ID: 6884 | OA
Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11
[Published Version] View | Files available | DOI | arXiv
 
[11]
2019 | Published | Conference Paper | IST-REx-ID: 6886 | OA
Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20
[Published Version] View | Files available | DOI | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:10.1007/978-3-030-04612-5_2
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23
[Published Version] View | Files available | DOI
 
[8]
2018 | Published | Journal Article | IST-REx-ID: 6006 | OA
Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. Games. 2018;9(3). doi:10.3390/g9030039
[Published Version] View | Files available | DOI
 
[7]
2018 | Published | Journal Article | IST-REx-ID: 608 | OA
Avni G, Kupferman O. Synthesis from component libraries with costs. Theoretical Computer Science. 2018;712:50-72. doi:10.1016/j.tcs.2017.11.001
[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. Computing scores of forwarding schemes in switched networks with probabilistic faults. In: Vol 10206. Springer; 2017:169-187. doi:10.1007/978-3-662-54580-5_10
[Submitted Version] View | Files available | DOI | WoS
 
[5]
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21
[Published Version] View | Files available | DOI | arXiv
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.37
[Published Version] View | Files available | DOI
 
[3]
2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. In: AAAI Press; 2017:70-76. doi:10.24963/ijcai.2017/11
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1341 | OA
Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. In: Vol 9928. Springer; 2016:153-166. doi:10.1007/978-3-662-53354-3_13
[Preprint] View | Files available | DOI
 
[1]
2016 | Published | Conference Paper | IST-REx-ID: 1135 | OA
Avni G, Guha S, Rodríguez Navas G. Synthesizing time triggered schedules for switched networks with faulty links. In: Proceedings of the 13th International Conference on Embedded Software . ACM; 2016. doi:10.1145/2968478.2968499
[Submitted Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

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. Bidding graph games with partially-observable budgets. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. ; 2023:5464-5471. doi:10.1609/aaai.v37i5.25679
[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. Reachability poorman discrete-bidding games. In: Frontiers in Artificial Intelligence and Applications. Vol 372. IOS Press; 2023:141-148. doi:10.3233/FAIA230264
[Published Version] View | Files available | DOI | arXiv
 
[23]
2022 | Published | Conference Paper | IST-REx-ID: 12509 | OA
Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3
[Published Version] View | Files available | DOI
 
[22]
2021 | Published | Journal Article | IST-REx-ID: 9239 | OA
Avni G, Henzinger TA, Žikelić Đ. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 2021;119(8):133-144. doi:10.1016/j.jcss.2021.02.008
[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. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 2021;17(1):10:1-10:23. doi:10.23638/LMCS-17(1:10)2021
[Published Version] View | Files available | DOI | WoS | arXiv
 
[20]
2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:617-636. doi:10.1137/1.9781611976465.38
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2020 | Published | Conference Paper | IST-REx-ID: 8599 | OA
Avni G, Henzinger TA. A survey of bidding games on graphs. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.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. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21
[Published Version] View | Files available | DOI
 
[17]
2020 | Published | Journal Article | IST-REx-ID: 6761 | OA
Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031
[Submitted Version] View | Files available | DOI | WoS
 
[16]
2020 | Published | Journal Article | IST-REx-ID: 9197
Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546
[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. Run-time optimization for learned controllers through quantitative games. In: 31st International Conference on Computer-Aided Verification. Vol 11561. Springer; 2019:630-649. doi:10.1007/978-3-030-25540-4_36
[Published Version] View | Files available | DOI | WoS
 
[14]
2019 | Published | Journal Article | IST-REx-ID: 6752 | OA
Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. Journal of the ACM. 2019;66(4). doi:10.1145/3340295
[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. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1
[Submitted Version] View | Files available | DOI
 
[12]
2019 | Published | Conference Paper | IST-REx-ID: 6884 | OA
Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11
[Published Version] View | Files available | DOI | arXiv
 
[11]
2019 | Published | Conference Paper | IST-REx-ID: 6886 | OA
Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20
[Published Version] View | Files available | DOI | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:10.1007/978-3-030-04612-5_2
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[9]
2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23
[Published Version] View | Files available | DOI
 
[8]
2018 | Published | Journal Article | IST-REx-ID: 6006 | OA
Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. Games. 2018;9(3). doi:10.3390/g9030039
[Published Version] View | Files available | DOI
 
[7]
2018 | Published | Journal Article | IST-REx-ID: 608 | OA
Avni G, Kupferman O. Synthesis from component libraries with costs. Theoretical Computer Science. 2018;712:50-72. doi:10.1016/j.tcs.2017.11.001
[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. Computing scores of forwarding schemes in switched networks with probabilistic faults. In: Vol 10206. Springer; 2017:169-187. doi:10.1007/978-3-662-54580-5_10
[Submitted Version] View | Files available | DOI | WoS
 
[5]
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21
[Published Version] View | Files available | DOI | arXiv
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.37
[Published Version] View | Files available | DOI
 
[3]
2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. In: AAAI Press; 2017:70-76. doi:10.24963/ijcai.2017/11
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1341 | OA
Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. In: Vol 9928. Springer; 2016:153-166. doi:10.1007/978-3-662-53354-3_13
[Preprint] View | Files available | DOI
 
[1]
2016 | Published | Conference Paper | IST-REx-ID: 1135 | OA
Avni G, Guha S, Rodríguez Navas G. Synthesizing time triggered schedules for switched networks with faulty links. In: Proceedings of the 13th International Conference on Embedded Software . ACM; 2016. doi:10.1145/2968478.2968499
[Submitted Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed