1 citations · 2 across the 6 of their papers we have counts for
7 papers
Decoupled Planning for Multiple Omega-Regular Objectives
Guy Avni, Thomas A. Henzinger, Kaushik Mallik +2
We study the problem of generating paths on a graph that satisfy a collection of ω-regular objectives. We propose a decoupled framework in which each objective is assigned to an in…
Mean-payoff and Energy Discrete Bidding Games
Guy Avni, Suman Sadhukhan
A \emph{bidding} game is played on a graph as follows. A token is placed on an initial vertex and both players are allocated budgets. In each turn, the players simultaneously submi…
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…
Auction-Based Scheduling
Guy Avni, Kaushik Mallik, Suman Sadhukhan
Many sequential decision-making tasks require satisfaction of multiple, partially contradictory objectives. Existing approaches are monolithic, namely all objectives are fulfilled…
Reachability Poorman Discrete-Bidding Games
Guy Avni, Tobias Meggendorfer, Suman Sadhukhan +2
We consider {\em bidding games}, a class of two-player zero-sum {\em graph games}. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of…
Computing Threshold Budgets in Discrete-Bidding Games
Guy Avni, Suman Sadhukhan
In a two-player zero-sum graph game, the players move a token throughout a graph to produce an infinite play, which determines the winner of the game. Bidding games are graph games…
Dynamic network congestion games
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan +1
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players ch…