default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuy Avni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Yotam Amitai
, Ofra Amir, Guy Avni:
ASQ-IT: Interactive explanations for reinforcement-learning agents. Artif. Intell. 335: 104182 (2024)- [c35]Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik:
Bidding Games with Charging. CONCUR 2024: 8:1-8:17 - [c34]Shaull Almagor, Guy Avni, Henry Sinclair-Banks, Asaf Yeshurun:
Dimension-Minimality and Primality of Counter Nets. FoSSaCS (2) 2024: 229-249 - [c33]Guy Avni, Kaushik Mallik, Suman Sadhukhan:
Auction-Based Scheduling. TACAS (3) 2024: 153-172 - [e1]Guy Avni, Mirco Giacobbe, Taylor T. Johnson, Guy Katz, Anna Lukina, Nina Narodytska, Christian Schilling:
AI Verification - First International Symposium, SAIV 2024, Montreal, QC, Canada, July 22-23, 2024, Proceedings. Lecture Notes in Computer Science 14846, Springer 2024, ISBN 978-3-031-65111-3 [contents] - [i18]Florent Delgrange, Guy Avni, Anna Lukina, Christian Schilling, Ann Nowé, Guillermo A. Pérez:
Synthesis of Hierarchical Controllers Based on Deep Reinforcement Learning Policies. CoRR abs/2402.13785 (2024) - [i17]Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik:
Bidding Games with Charging. CoRR abs/2407.06288 (2024) - 2023
- [j12]Guy Avni, Shibashis Guha, Orna Kupferman:
Timed network games. Inf. Comput. 290: 104996 (2023) - [c32]Guy Avni, Ismaël Jecker, Dorde Zikelic:
Bidding Graph Games with Partially-Observable Budgets. AAAI 2023: 5464-5471 - [c31]Guy Avni, Pranav Ghorpade, Shibashis Guha:
A Game of Pawns. CONCUR 2023: 16:1-16:17 - [c30]Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Dorde Zikelic:
Reachability Poorman Discrete-Bidding Games. ECAI 2023: 141-148 - [i16]Yotam Amitai, Guy Avni, Ofra Amir:
ASQ-IT: Interactive Explanations for Reinforcement-Learning Agents. CoRR abs/2301.09941 (2023) - [i15]Guy Avni, Pranav Ghorpade, Shibashis Guha:
A Game of Pawns. CoRR abs/2305.04096 (2023) - [i14]Shaull Almagor, Guy Avni, Henry Sinclair-Banks, Asaf Yeshurun:
Dimension-Minimality and Primality of Counter Nets. CoRR abs/2307.14492 (2023) - [i13]Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Dorde Zikelic:
Reachability Poorman Discrete-Bidding Games. CoRR abs/2307.15218 (2023) - [i12]Guy Avni, Kaushik Mallik, Suman Sadhukhan:
Auction-Based Scheduling. CoRR abs/2310.11798 (2023) - 2022
- [c29]Guy Avni, Suman Sadhukhan:
Computing Threshold Budgets in Discrete-Bidding Games. FSTTCS 2022: 30:1-30:18 - [c28]Guy Avni, Thomas A. Henzinger:
An Updated Survey of Bidding Games on Graphs (Invited Talk). MFCS 2022: 3:1-3:6 - [i11]Guy Avni, Suman Sadhukhan:
Computing Threshold Budgets in Discrete-Bidding Games. CoRR abs/2210.02773 (2022) - [i10]Guy Avni, Ismaël Jecker, Dorde Zikelic:
Bidding Graph Games with Partially-Observable Budgets. CoRR abs/2211.13626 (2022) - 2021
- [j11]Guy Avni, Thomas A. Henzinger, Dorde Zikelic:
Bidding mechanisms in graph games. J. Comput. Syst. Sci. 119: 133-144 (2021) - [j10]Milad Aghajohari, Guy Avni, Thomas A. Henzinger:
Determinacy in Discrete-Bidding Infinite-Duration Games. Log. Methods Comput. Sci. 17(1) (2021) - [c27]Guy Avni, Ismaël Jecker, Dorde Zikelic:
Infinite-Duration All-Pay Bidding Games. SODA 2021: 617-636 - 2020
- [j9]Guy Avni, Thomas A. Henzinger, Orna Kupferman:
Dynamic resource allocation games. Theor. Comput. Sci. 807: 42-55 (2020) - [c26]Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec:
All-Pay Bidding Games on Graphs. AAAI 2020: 1798-1805 - [c25]Guy Avni, Thomas A. Henzinger:
A Survey of Bidding Games on Graphs (Invited Paper). CONCUR 2020: 2:1-2:21 - [c24]Parand Alizadeh Alamdari, Guy Avni, Thomas A. Henzinger, Anna Lukina:
Formal Methods with a Touch of Magic. FMCAD 2020: 138-147 - [i9]Guy Avni, Ismaël Jecker, Dorde Zikelic:
Infinite-Duration All-Pay Bidding Games. CoRR abs/2005.06636 (2020) - [i8]Parand Alizadeh Alamdari, Guy Avni, Thomas A. Henzinger, Anna Lukina:
Formal Methods with a Touch of Magic. CoRR abs/2005.12175 (2020)
2010 – 2019
- 2019
- [j8]Guy Avni, Thomas A. Henzinger, Ventsislav Chonev:
Infinite-duration Bidding Games. J. ACM 66(4): 31:1-31:29 (2019) - [c23]Guy Avni, Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, Bettina Könighofer, Stefan Pranger:
Run-Time Optimization for Learned Controllers Through Quantitative Games. CAV (1) 2019: 630-649 - [c22]Milad Aghajohari, Guy Avni, Thomas A. Henzinger:
Determinacy in Discrete-Bidding Infinite-Duration Games. CONCUR 2019: 20:1-20:17 - [c21]Guy Avni, Thomas A. Henzinger, Dorde Zikelic:
Bidding Mechanisms in Graph Games. MFCS 2019: 11:1-11:13 - [c20]Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný:
Bidding Games on Markov Decision Processes. RP 2019: 1-12 - [i7]Milad Aghajohari, Guy Avni, Thomas A. Henzinger:
Determinacy in Discrete-Bidding Infinite-Duration Games. CoRR abs/1905.03588 (2019) - [i6]Guy Avni, Thomas A. Henzinger, Dorde Zikelic:
Bidding Mechanisms in Graph Games. CoRR abs/1905.03835 (2019) - [i5]Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec:
All-Pay Bidding Games on Graphs. CoRR abs/1911.08360 (2019) - 2018
- [j7]Guy Avni, Shibashis Guha, Orna Kupferman:
An Abstraction-Refinement Methodologyfor Reasoning about Network Games†. Games 9(3): 39 (2018) - [j6]Guy Avni, Orna Kupferman:
Synthesis from component libraries with costs. Theor. Comput. Sci. 712: 50-72 (2018) - [c19]Guy Avni, Shibashis Guha, Orna Kupferman:
Timed Network Games with Clocks. MFCS 2018: 23:1-23:18 - [c18]Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen:
Infinite-Duration Poorman-Bidding Games. WINE 2018: 21-36 - [i4]Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen:
Infinite-Duration Poorman-Bidding Games. CoRR abs/1804.04372 (2018) - [i3]Guy Avni, Shibashis Guha, Orna Kupferman:
Timed Network Games with Clocks. CoRR abs/1808.04882 (2018) - 2017
- [c17]Guy Avni, Thomas A. Henzinger, Ventsislav Chonev:
Infinite-Duration Bidding Games. CONCUR 2017: 21:1-21:18 - [c16]Guy Avni, Shibashis Guha, Orna Kupferman:
An Abstraction-Refinement Methodology for Reasoning about Network Games. IJCAI 2017: 70-76 - [c15]Guy Avni, Shibashis Guha, Orna Kupferman:
Timed Network Games. MFCS 2017: 37:1-37:16 - [c14]Guy Avni, Shubham Goel, Thomas A. Henzinger, Guillermo Rodríguez-Navas:
Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults. TACAS (2) 2017: 169-187 - [i2]Guy Avni, Shubham Goel, Thomas A. Henzinger, Guillermo Rodríguez-Navas:
Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults. CoRR abs/1701.03519 (2017) - [i1]Guy Avni, Ventsislav Chonev, Thomas A. Henzinger:
Infinite-Duration Bidding Games. CoRR abs/1705.01433 (2017) - 2016
- [b1]Guy Avni:
Quantitative Formal Methods Meets Algorithmic Game Theory (שער נוסף בעברית: שיטות פורמליות כמותיות פוגשות את תורת המשחקים החישובית.). Hebrew University of Jerusalem, Israel, 2016 - [j5]Guy Avni, Orna Kupferman, Tami Tamir:
Network-formation games with regular objectives. Inf. Comput. 251: 165-178 (2016) - [j4]Guy Avni, Tami Tamir:
Cost-sharing scheduling games on restricted unrelated machines. Theor. Comput. Sci. 646: 26-39 (2016) - [c13]Guy Avni, Shibashis Guha, Guillermo Rodríguez-Navas:
Synthesizing time-triggered schedules for switched networks with faulty links. EMSOFT 2016: 26:1-26:10 - [c12]Guy Avni, Thomas A. Henzinger, Orna Kupferman:
Dynamic Resource Allocation Games. SAGT 2016: 153-166 - 2015
- [c11]Shaull Almagor, Guy Avni, Orna Kupferman:
Repairing Multi-Player Games. CONCUR 2015: 325-339 - [c10]Guy Avni, Orna Kupferman, Tami Tamir:
Congestion Games with Multisets of Resources and Applications in Synthesis. FSTTCS 2015: 365-379 - [c9]Guy Avni, Orna Kupferman:
Stochastization of Weighted Automata. MFCS (1) 2015: 89-102 - [c8]Guy Avni, Tami Tamir:
Cost-Sharing Scheduling Games on Restricted Unrelated Machines. SAGT 2015: 69-81 - 2014
- [j3]Guy Avni, Orna Kupferman:
An abstraction-refinement framework for trigger querying. Formal Methods Syst. Des. 44(2): 149-175 (2014) - [j2]Guy Avni, Orna Kupferman:
Parameterized Weighted Containment. ACM Trans. Comput. Log. 16(1): 6:1-6:25 (2014) - [c7]Guy Avni, Orna Kupferman, Tami Tamir:
From Reachability to Temporal Specifications in Cost-Sharing Games. IJCAR 2014: 1-15 - [c6]Guy Avni, Orna Kupferman:
Synthesis from Component Libraries with Costs. CONCUR 2014: 156-172 - [c5]Guy Avni, Orna Kupferman, Tami Tamir:
Network-Formation Games with Regular Objectives. FoSSaCS 2014: 119-133 - 2013
- [j1]Guy Avni, Orna Kupferman:
When does abstraction help? Inf. Process. Lett. 113(22-24): 901-905 (2013) - [c4]Shaull Almagor, Guy Avni, Orna Kupferman:
Automatic Generation of Quality Specifications. CAV 2013: 479-494 - [c3]Guy Avni, Orna Kupferman:
Parameterized Weighted Containment. FoSSaCS 2013: 369-384 - 2012
- [c2]Guy Avni, Orna Kupferman:
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction. CONCUR 2012: 84-99 - 2011
- [c1]Guy Avni, Orna Kupferman:
An Abstraction-Refinement Framework for Trigger Querying. SAS 2011: 263-279
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
