We answer an open question of [Hazon and Elkind, 2010] by presenting a polynomial-time algorithm for finding a safe strategic vote under the Borda rule.Expand

We study whether scoring rules can be robust to adding or deleting particular candidates, as occurs with spoilers in political elections and with athletes in sports due to doping allegations.Expand

We show that a natural decision problem about mixed equilibria: determining whether a Boolean game has a mixed strategy equilibrium that guarantees every player a given payoff, is NEXP-hard.Expand

We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility.Expand

Boolean games are a succinct representation of strategic games wherein a player seeks to satisfy a formula of propositional logic by selecting a truth assignment to a set of variables under his control.Expand

We consider the problem of electing a committee of $k$ candidates, subject to some constraints as to what this committee is supposed to look like.Expand