activity
20092023
most citedFairness-aware Configuration of Machine Learning Libraries

45 citations · 149 across the 52 of their papers we have counts for

collaborators
Showing cs.GTShow all

7 papers · 1 filter

cs.GT2021★ 1 cited

Discounting the Past

Taylor Dohmen, Ashutosh Trivedi

Stochastic games with discounted payoff, introduced by Shapley, model adversarial interactions in stochastic environments where two players try to optimize a discounted sum of rewa…

cs.GT2016

Mean-Payoff Games on Timed Automata

Shibashis Guha, Marcin Jurdzinski, Krishna S. +1

Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players, Player Min and Player Max, by moving a…

cs.GT2015

Incentive Stackelberg Mean-payoff Games

Anshul Gupta, M. S. Krishna Deepak, Bharath Kumar Padarthi +2

We introduce and study incentive equilibria for multi-player meanpayoff games. Incentive equilibria generalise well-studied solution concepts such as Nash equilibria and leader equ…

cs.GT2015

Symmetric Strategy Improvement

Sven Schewe, Ashutosh Trivedi, Thomas Varghese

Symmetry is inherent in the definition of most of the two-player zero-sum games, including parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that n…

cs.GT2014★ 1 cited

Adding Negative Prices to Priced Timed Games

Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna +3

Priced timed games (PTGs) are two-player zero-sum games played on the infinite graph of configurations of priced timed automata where two players take turns to choose transitions i…

cs.GT2010★ 1 cited

Quantitative Games on Probabilistic Timed Automata

Marta Kwiatkowska, Gethin Norman, Ashutosh Trivedi

Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the controller, wh…