activity
20182026
most citedFormal Methods with a Touch of Magic

2 citations · 3 across the 9 of their papers we have counts for

collaborators
Showing cs.GTShow all

14 papers · 1 filter

cs.GT2026

Analyzing the Interaction of Optimal Strategies in Mean-Payoff Bidding Games

Shaull Almagor, Guy Avni, Julian Ewaied

A common assumption when designing an agent in a multi-agent system is that the other agents behave adversarially. This allows a designer to obtain the strongest guarantees when th…

cs.GT2026

Multi-Player Discrete-Bidding Games; Determinacy, Equilibria, and Complexity

Guy Avni, Fatima Murra

Games on graphs constitute a fundamental model. Applications include reactive synthesis, which reduces to solving a zero-sum two-player game, and reasoning about multi-agent system…

cs.GT2025

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…

cs.GT2024

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…

cs.GT2024

Robin Hood Reachability Bidding Games

Shaull Almagor, Guy Avni, Neta Dafni

Two-player graph games are a fundamental model for reasoning about the interaction of agents. These games are played between two players who move a token along a graph. In bidding…

cs.GT2024

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…