How long does it take until economic agents converge to an equilibrium? By studying the
complexity of the problem of computing a mixed Nash equilibrium in a game, we provide …

In this paper, we aim to investigate the optimal synchronization problem for a group of
generic linear systems with input saturation. To seek the optimal controller, Hamilton-Jacobi …

Representing and reasoning with games becomes difficult once they involve large numbers
of actions and players, because the space requirement for utility functions can grow …

We address the fundamental question of whether the Nash equilibria of a game can be
computed in polynomial time. We describe certain efficient reductions between this problem …

Graphical Games Page 1 Graphical Games Michael Kearns May 23, 2011 Michael Kearns ()
Graphical Games May 23, 2011 1 / 30 Page 2 M.Kearns, M. Littman, and S.Singh Graphical …

We resolve the computational complexity of two problems known as Necklace Splitting and
Discrete Ham Sandwich, showing that they are PPA-complete. For Necklace Splitting, this …

This paper investigates the optimal synchronization and disturbance rejection problem for
leader-follower multi-agent systems (MASs) subject to constrained input using online actor …

We show that the computational problem Consensus Halving is PPA-Complete, the first PPA-
Completeness result for a problem whose definition does not involve an explicit circuit. We …

Public goods games study the incentives of individuals to contribute to a public good and
their behaviors in equilibria. In this paper, we examine a specific type of public goods game …

We present a reduction from graphical games to Markov random fields so that pure Nash
equilibria in the former can be found by statistical inference on the latter. Our result, when …