Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Guy Avni and Thomas A. Henzinger. An Updated Survey of Bidding Games on Graphs (Invited Talk). In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 3:1-3:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{avni_et_al:LIPIcs.MFCS.2022.3, author = {Avni, Guy and Henzinger, Thomas A.}, title = {{An Updated Survey of Bidding Games on Graphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {3:1--3:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.3}, URN = {urn:nbn:de:0030-drops-168017}, doi = {10.4230/LIPIcs.MFCS.2022.3}, annote = {Keywords: Bidding games, Richman bidding, poorman bidding, mean-payoff, parity} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Guy Avni and Thomas A. Henzinger. A Survey of Bidding Games on Graphs (Invited Paper). In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 2:1-2:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{avni_et_al:LIPIcs.CONCUR.2020.2, author = {Avni, Guy and Henzinger, Thomas A.}, title = {{A Survey of Bidding Games on Graphs}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {2:1--2:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.2}, URN = {urn:nbn:de:0030-drops-128147}, doi = {10.4230/LIPIcs.CONCUR.2020.2}, annote = {Keywords: Bidding games, Richman bidding, poorman bidding, mean-payoff, parity} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Guy Avni, Thomas A. Henzinger, and Ventsislav Chonev. Infinite-Duration Bidding Games. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 21:1-21:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{avni_et_al:LIPIcs.CONCUR.2017.21, author = {Avni, Guy and Henzinger, Thomas A. and Chonev, Ventsislav}, title = {{Infinite-Duration Bidding Games}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Meyer, Roland and Nestmann, Uwe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.21}, URN = {urn:nbn:de:0030-drops-77741}, doi = {10.4230/LIPIcs.CONCUR.2017.21}, annote = {Keywords: Bidding Games, Parity Games, Mean-Payoff Games, Richman Games} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Ventsislav Chonev, Joël Ouaknine, and James Worrell. On the Skolem Problem for Continuous Linear Dynamical Systems. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 100:1-100:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chonev_et_al:LIPIcs.ICALP.2016.100, author = {Chonev, Ventsislav and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{On the Skolem Problem for Continuous Linear Dynamical Systems}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {100:1--100:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.100}, URN = {urn:nbn:de:0030-drops-62357}, doi = {10.4230/LIPIcs.ICALP.2016.100}, annote = {Keywords: differential equations, reachability, Baker’s Theorem, Schanuel’s Conjecture, semi-algebraic sets} }
Feedback for Dagstuhl Publishing