98 citations · 539 across the 20 of their papers we have counts for
25 papers
Sharper bounds on the thresholds for sensitive and Blackwell optimality
Xavier Allamigeon, Stéphane Gaubert, Julien Grand-Clément +1
In perfect-information two-player stochastic games, the notions of Blackwell and sensitive optimality provide generalizations of the classical mean-payoff optimality and discount o…
Thresholds for sensitive optimality and Blackwell optimality in stochastic games
Stéphane Gaubert, Julien Grand-Clément, Ricardo D. Katz
We investigate refinements of the mean-payoff criterion in two-player zero-sum perfect-information stochastic games. A strategy is Blackwell optimal if it is optimal in the discoun…
Brewer-Nash Scrutinised: Mechanised Checking of Policies featuring Write Revocation
Alfredo Capozucca, Maximiliano Cristiá, Ross Horne +1
This paper revisits the Brewer-Nash security policy model inspired by ethical Chinese Wall policies. We draw attention to the fact that write access can be revoked in the Brewer-Na…
Universal Complexity Bounds Based on Value Iteration for Stochastic Mean Payoff Games and Entropy Games
Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz +1
We develop value iteration-based algorithms to solve in a unified manner different classes of combinatorial zero-sum games with mean-payoff type rewards. These algorithms rely on a…
Formalizing the Face Lattice of Polyhedra
Xavier Allamigeon, Ricardo D. Katz, Pierre-Yves Strub
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistan…
Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra
Maximiliano Cristiá, Ricardo D. Katz, Gianfranco Rossi
{log} ('setlog') is a satisfiability solver for formulas of the theory of finite sets and finite set relation algebra (FSTRA). As such, it can be used as an automated theorem prove…