output
20032013
most citedAnisotropic Reinforcement of Nanocomposites Tuned by Magnetic Orientation of the Filler Network

75 citations

researchers with a paper here
collaborating institutions
Showing cs.GTShow all

6 papers · 1 filter

cs.GT2012★ 1 cited

Convergence to Equilibrium of Logit Dynamics for Strategic Games

Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale +2

We present the first general bounds on the mixing time of the Markov chain associated to the logit dynamics for wide classes of strategic games. The logit dynamics with inverse noi…

cs.GT2011

The complexity of approximate Nash equilibrium in congestion games with negative delays

Frederic Magniez, Michel de Rougemont, Miklos Santha +1

We extend the study of the complexity of finding an $\eps$-approximate Nash equilibrium in congestion games from the case of positive delay functions to delays of arbitrary sign. W…

cs.GT2010★ 5 cited

How do we remember the past in randomised strategies?

Julien Cristau, Claire David, Florian Horn

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represen…

cs.GT2010

Blackwell-Optimal Strategies in Priority Mean-Payoff Games

Hugo Gimbert, Wiesław Zielonka

We examine perfect information stochastic mean-payoff games - a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that determin…

cs.GT2007★ 26 cited

The Complexity of Games on Higher Order Pushdown Automata

Thierry Cachat, Igor Walukiewicz

We prove an n-EXPTIME lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known up…

cs.GT2006

Controller synthesis & Ordinal Automata

Thierry Cachat

Ordinal automata are used to model physical systems with Zeno behavior. Using automata and games techniques we solve a control problem formulated and left open by Demri and Nowak i…