28 citations · 73 across the 18 of their papers we have counts for
4 papers · 1 filter
Generalized Bidding Games: Where Bidding and Stochastic Games Meet
Ali Asadi, Thomas A. Henzinger, Ehsan Kafshdar Goharshady +2
Two-player games on graphs are a classical framework for analyzing strategic decision making. In turn-based games, two players move a token along the edges of the graph, and the ri…
Bidding Games on Markov Decision Processes with Quantitative Reachability Objectives
Guy Avni, Martin Kurečka, Kaushik Mallik +2
Graph games are fundamental in strategic reasoning of multi-agent systems and their environments. We study a new family of graph games which combine stochastic environmental uncert…
Bidding Games with Charging
Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger +1
Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the player…
Computing Adequately Permissive Assumptions for Synthesis
Ashwani Anand, Kaushik Mallik, Satya Prakash Nayak +1
We solve the problem of automatically computing a new class of environment assumptions in two-player turn-based finite graph games which characterize an ``adequate cooperation'' ne…