16 Publications

Mark all

[16]
2020 | Journal Article | IST-REx-ID: 6761
Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science, 807, 42–55. https://doi.org/10.1016/j.tcs.2019.06.031
View | Files available | DOI
 
[15]
2019 | Conference Paper | IST-REx-ID: 6822   OA
Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In 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
View | Files available | DOI
 
[14]
2019 | Conference Paper | IST-REx-ID: 6884   OA
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
View | Files available | DOI | arXiv
 
[13]
2019 | Journal Article | IST-REx-ID: 6752
Avni, G., Henzinger, T. A., & Chonev, V. K. (2019). Infinite-duration bidding games. Journal of the ACM, 66(4). https://doi.org/10.1145/3340295
View | Files available | DOI | Download (ext.) | arXiv
 
[12]
2019 | Conference Paper | IST-REx-ID: 6462   OA
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
View | Files available | DOI
 
[11]
2019 | Conference Paper | IST-REx-ID: 6886   OA
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
View | Files available | DOI | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 5788   OA
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
View | DOI | Download (ext.) | arXiv
 
[9]
2018 | Conference Paper | IST-REx-ID: 6005
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
View | Files available | DOI
 
[8]
2018 | 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). https://doi.org/10.3390/g9030039
View | Files available | DOI
 
[7]
2018 | Journal Article | IST-REx-ID: 608
Avni, G., & Kupferman, O. (2018). Synthesis from component libraries with costs. Theoretical Computer Science, 712, 50–72. https://doi.org/10.1016/j.tcs.2017.11.001
View | DOI
 
[6]
2017 | Conference Paper | IST-REx-ID: 1116   OA
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
View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 1003
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
View | Files available | DOI
 
[4]
2017 | Conference Paper | IST-REx-ID: 950   OA
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
View | Files available | DOI | arXiv
 
[3]
2017 | Conference Paper | IST-REx-ID: 963   OA
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
View | Files available | DOI
 
[2]
2016 | 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. In Proceedings of the 13th International Conference on Embedded Software . Pittsburgh, PA, USA: ACM. https://doi.org/10.1145/2968478.2968499
View | Files available | DOI
 
[1]
2016 | Conference Paper | IST-REx-ID: 1341
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
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

16 Publications

Mark all

[16]
2020 | Journal Article | IST-REx-ID: 6761
Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science, 807, 42–55. https://doi.org/10.1016/j.tcs.2019.06.031
View | Files available | DOI
 
[15]
2019 | Conference Paper | IST-REx-ID: 6822   OA
Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In 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
View | Files available | DOI
 
[14]
2019 | Conference Paper | IST-REx-ID: 6884   OA
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
View | Files available | DOI | arXiv
 
[13]
2019 | Journal Article | IST-REx-ID: 6752
Avni, G., Henzinger, T. A., & Chonev, V. K. (2019). Infinite-duration bidding games. Journal of the ACM, 66(4). https://doi.org/10.1145/3340295
View | Files available | DOI | Download (ext.) | arXiv
 
[12]
2019 | Conference Paper | IST-REx-ID: 6462   OA
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
View | Files available | DOI
 
[11]
2019 | Conference Paper | IST-REx-ID: 6886   OA
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
View | Files available | DOI | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 5788   OA
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
View | DOI | Download (ext.) | arXiv
 
[9]
2018 | Conference Paper | IST-REx-ID: 6005
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
View | Files available | DOI
 
[8]
2018 | 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). https://doi.org/10.3390/g9030039
View | Files available | DOI
 
[7]
2018 | Journal Article | IST-REx-ID: 608
Avni, G., & Kupferman, O. (2018). Synthesis from component libraries with costs. Theoretical Computer Science, 712, 50–72. https://doi.org/10.1016/j.tcs.2017.11.001
View | DOI
 
[6]
2017 | Conference Paper | IST-REx-ID: 1116   OA
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
View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 1003
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
View | Files available | DOI
 
[4]
2017 | Conference Paper | IST-REx-ID: 950   OA
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
View | Files available | DOI | arXiv
 
[3]
2017 | Conference Paper | IST-REx-ID: 963   OA
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
View | Files available | DOI
 
[2]
2016 | 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. In Proceedings of the 13th International Conference on Embedded Software . Pittsburgh, PA, USA: ACM. https://doi.org/10.1145/2968478.2968499
View | Files available | DOI
 
[1]
2016 | Conference Paper | IST-REx-ID: 1341
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
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed