8 Result(s)
within
Felix Brandt
Computer Science
English
Theory of Computation
-
Article
The Complexity of Computing Minimal Unidirectional Covering Sets
A common thread in the social sciences is to identify sets of alternatives that satisfy certain notions of stability according to some binary dominance relation. Examples can be found in areas as diverse as vo...
-
Article
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the empirical frequencies of act...
-
Article
The Computational Complexity of Weak Saddles
We study the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. F. Brandt et al. recently gave a polynomial-time algorithm for computing weak saddles in a subcla...
-
Article
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
In game theory, an action is said to be weakly dominated if there exists another action of the same player that, with respect to what the other players do, is never worse and sometimes strictly better. We inve...
-
Chapter and Conference Paper
The Complexity of Computing Minimal Unidirectional Covering Sets
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in are...
-
Chapter and Conference Paper
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the empirical frequencies of act...
-
Chapter and Conference Paper
Equilibria of Graphical Games with Symmetries
We study graphical games where the payoff function of each player satisfies one of four types of symmetry in the actions of his neighbors. We establish that deciding the existence of a pure Nash equilibrium is...
-
Chapter and Conference Paper
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A common aspect, enabling the compact representation of games even when the number of players is unbounded, is that players cannot (or need not) dis...
