activity
20202026
most citedLower bound on the size of a quasirandom forcing set of permutations

7 citations · 8 across the 4 of their papers we have counts for

collaborators
Showing cs.GTShow all

1 paper · 1 filter

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…