Guy Avni

Henzinger_Thomas Group

25 Publications

Mark all

[25]
2023 | Conference Paper | IST-REx-ID: 14243 | OA
Bidding graph games with partially-observable budgets
G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[24]
2023 | Conference Paper | IST-REx-ID: 14518 | OA
Reachability poorman discrete-bidding games
G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, D. Zikelic, in:, Frontiers in Artificial Intelligence and Applications, IOS Press, 2023, pp. 141–148.
[Published Version] View | Files available | DOI | arXiv
 
[23]
2022 | Conference Paper | IST-REx-ID: 12509 | OA
An updated survey of bidding games on graphs
G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6.
[Published Version] View | Files available | DOI
 
[22]
2021 | Conference Paper | IST-REx-ID: 10694 | OA
Infinite-duration all-pay bidding games
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2021 | Journal Article | IST-REx-ID: 9239 | OA
Bidding mechanisms in graph games
G. Avni, T.A. Henzinger, Đ. Žikelić, Journal of Computer and System Sciences 119 (2021) 133–144.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[20]
2021 | Journal Article | IST-REx-ID: 10674 | OA
Determinacy in discrete-bidding infinite-duration games
M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[19]
2020 | Conference Paper | IST-REx-ID: 8599 | OA
A survey of bidding games on graphs
G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | Files available | DOI
 
[18]
2020 | Conference Paper | IST-REx-ID: 9040 | OA
Formal methods with a touch of magic
P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147.
[Published Version] View | Files available | DOI
 
[17]
2020 | Journal Article | IST-REx-ID: 6761 | OA
Dynamic resource allocation games
G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.
[Submitted Version] View | Files available | DOI | WoS
 
[16]
2020 | Journal Article | IST-REx-ID: 9197
All-pay bidding games on graphs
G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.
[Preprint] View | DOI | arXiv
 
[15]
2019 | Conference Paper | IST-REx-ID: 6822 | OA
Bidding games on Markov decision processes
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.
[Submitted Version] View | Files available | DOI
 
[14]
2019 | Conference Paper | IST-REx-ID: 6886 | OA
Determinacy in discrete-bidding infinite-duration games
M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI | arXiv
 
[13]
2019 | Conference Paper | IST-REx-ID: 6884 | OA
Bidding mechanisms in graph games
G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI | arXiv
 
[12]
2019 | Conference Paper | IST-REx-ID: 6462 | OA
Run-time optimization for learned controllers through quantitative games
G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger, in:, 31st International Conference on Computer-Aided Verification, Springer, 2019, pp. 630–649.
[Published Version] View | Files available | DOI | WoS
 
[11]
2019 | Journal Article | IST-REx-ID: 6752 | OA
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, Journal of the ACM 66 (2019).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 6005 | OA
Timed network games with clocks
G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version] View | Files available | DOI
 
[9]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Infinite-duration poorman-bidding games
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 608 | OA
Synthesis from component libraries with costs
G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[7]
2018 | Journal Article | IST-REx-ID: 6006 | OA
An abstraction-refinement methodology for reasoning about network games
G. Avni, S. Guha, O. Kupferman, Games 9 (2018).
[Published Version] View | Files available | DOI
 
[6]
2017 | Conference Paper | IST-REx-ID: 963 | OA
Timed network games with clocks
G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 950 | OA
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2017 | Conference Paper | IST-REx-ID: 1116 | OA
Computing scores of forwarding schemes in switched networks with probabilistic faults
G. Avni, S. Goel, T.A. Henzinger, G. Rodríguez Navas, in:, Springer, 2017, pp. 169–187.
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2017 | Conference Paper | IST-REx-ID: 1003 | OA
An abstraction-refinement methodology for reasoning about network games
G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2016 | Conference Paper | IST-REx-ID: 1135 | OA
Synthesizing time triggered schedules for switched networks with faulty links
G. Avni, S. Guha, G. Rodríguez Navas, in:, Proceedings of the 13th International Conference on Embedded Software , ACM, 2016.
[Submitted Version] View | Files available | DOI
 
[1]
2016 | Conference Paper | IST-REx-ID: 1341 | OA
Dynamic resource allocation games
G. Avni, T.A. Henzinger, O. Kupferman, in:, Springer, 2016, pp. 153–166.
[Preprint] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Default

    Export / Embed

25 Publications

Mark all

[25]
2023 | Conference Paper | IST-REx-ID: 14243 | OA
Bidding graph games with partially-observable budgets
G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[24]
2023 | Conference Paper | IST-REx-ID: 14518 | OA
Reachability poorman discrete-bidding games
G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, D. Zikelic, in:, Frontiers in Artificial Intelligence and Applications, IOS Press, 2023, pp. 141–148.
[Published Version] View | Files available | DOI | arXiv
 
[23]
2022 | Conference Paper | IST-REx-ID: 12509 | OA
An updated survey of bidding games on graphs
G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6.
[Published Version] View | Files available | DOI
 
[22]
2021 | Conference Paper | IST-REx-ID: 10694 | OA
Infinite-duration all-pay bidding games
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2021 | Journal Article | IST-REx-ID: 9239 | OA
Bidding mechanisms in graph games
G. Avni, T.A. Henzinger, Đ. Žikelić, Journal of Computer and System Sciences 119 (2021) 133–144.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[20]
2021 | Journal Article | IST-REx-ID: 10674 | OA
Determinacy in discrete-bidding infinite-duration games
M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[19]
2020 | Conference Paper | IST-REx-ID: 8599 | OA
A survey of bidding games on graphs
G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version] View | Files available | DOI
 
[18]
2020 | Conference Paper | IST-REx-ID: 9040 | OA
Formal methods with a touch of magic
P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147.
[Published Version] View | Files available | DOI
 
[17]
2020 | Journal Article | IST-REx-ID: 6761 | OA
Dynamic resource allocation games
G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.
[Submitted Version] View | Files available | DOI | WoS
 
[16]
2020 | Journal Article | IST-REx-ID: 9197
All-pay bidding games on graphs
G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.
[Preprint] View | DOI | arXiv
 
[15]
2019 | Conference Paper | IST-REx-ID: 6822 | OA
Bidding games on Markov decision processes
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.
[Submitted Version] View | Files available | DOI
 
[14]
2019 | Conference Paper | IST-REx-ID: 6886 | OA
Determinacy in discrete-bidding infinite-duration games
M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI | arXiv
 
[13]
2019 | Conference Paper | IST-REx-ID: 6884 | OA
Bidding mechanisms in graph games
G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI | arXiv
 
[12]
2019 | Conference Paper | IST-REx-ID: 6462 | OA
Run-time optimization for learned controllers through quantitative games
G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger, in:, 31st International Conference on Computer-Aided Verification, Springer, 2019, pp. 630–649.
[Published Version] View | Files available | DOI | WoS
 
[11]
2019 | Journal Article | IST-REx-ID: 6752 | OA
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, Journal of the ACM 66 (2019).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 6005 | OA
Timed network games with clocks
G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version] View | Files available | DOI
 
[9]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Infinite-duration poorman-bidding games
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 608 | OA
Synthesis from component libraries with costs
G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[7]
2018 | Journal Article | IST-REx-ID: 6006 | OA
An abstraction-refinement methodology for reasoning about network games
G. Avni, S. Guha, O. Kupferman, Games 9 (2018).
[Published Version] View | Files available | DOI
 
[6]
2017 | Conference Paper | IST-REx-ID: 963 | OA
Timed network games with clocks
G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 950 | OA
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2017 | Conference Paper | IST-REx-ID: 1116 | OA
Computing scores of forwarding schemes in switched networks with probabilistic faults
G. Avni, S. Goel, T.A. Henzinger, G. Rodríguez Navas, in:, Springer, 2017, pp. 169–187.
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2017 | Conference Paper | IST-REx-ID: 1003 | OA
An abstraction-refinement methodology for reasoning about network games
G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2016 | Conference Paper | IST-REx-ID: 1135 | OA
Synthesizing time triggered schedules for switched networks with faulty links
G. Avni, S. Guha, G. Rodríguez Navas, in:, Proceedings of the 13th International Conference on Embedded Software , ACM, 2016.
[Submitted Version] View | Files available | DOI
 
[1]
2016 | Conference Paper | IST-REx-ID: 1341 | OA
Dynamic resource allocation games
G. Avni, T.A. Henzinger, O. Kupferman, in:, Springer, 2016, pp. 153–166.
[Preprint] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Default

    Export / Embed