Search Results for author:
Found 2 papers, 0 papers with code
Active Learning of Mealy Machines with Timers
However, whereas Waga needs exponentially many concrete queries to implement a single symbolic query, we only need a polynomial number.
Stackelberg-Pareto Synthesis (Full Version)
In this paper, we study the framework of two-player Stackelberg games played on graphs in which Player 0 announces a strategy and Player 1 responds rationally with a strategy that is an optimal response.
Computer Science and Game Theory
Cannot find the paper you are looking for? You can
Submit a new open access paper.
