( en | de | ru )

 

Disambiguation of "Avni, Guy"

Author of the publication

copydeleteadd this publication to your clipboard
Reachability Poorman Discrete-Bidding Games.

, , , , and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 141-148. IOS Press, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yehuda Avniel

Karin Avnit

Avni Dörtbudak

Avni Yazan

Avni Mazrreku

 

Other publications of authors with the same name

Synthesis from Component Libraries with Costs., and . CONCUR, volume 8704 of Lecture Notes in Computer Science, page 156-172. Springer, (2014)Congestion Games with Multisets of Resources and Applications in Synthesis., , and . FSTTCS, volume 45 of LIPIcs, page 365-379. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Run-Time Optimization for Learned Controllers Through Quantitative Games., , , , , and . CAV (1), volume 11561 of Lecture Notes in Computer Science, page 630-649. Springer, (2019)Infinite-Duration Poorman-Bidding Games., , and . WINE, volume 11316 of Lecture Notes in Computer Science, page 21-36. Springer, (2018)Quantitative Formal Methods Meets Algorithmic Game Theory (שער נוסף בעברית: שיטות פורמליות כמותיות פוגשות את תורת המשחקים החישובית.).. Hebrew University of Jerusalem, Israel, (2016)Bidding Graph Games with Partially-Observable Budgets., , and . AAAI, page 5464-5471. AAAI Press, (2023)Infinite-Duration All-Pay Bidding Games., , and . SODA, page 617-636. SIAM, (2021)Formal Methods with a Touch of Magic., , , and . FMCAD, page 138-147. IEEE, (2020)Reachability Poorman Discrete-Bidding Games., , , , and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 141-148. IOS Press, (2023)An Updated Survey of Bidding Games on Graphs (Invited Talk)., and . MFCS, volume 241 of LIPIcs, page 3:1-3:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)