25 citations · 41 across the 2 of their papers we have counts for
4 papers
A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs
Krishnendu Chatterjee, Martin Chmelik, Jessica Davies
POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where give…
Eliminating the Weakest Link: Making Manipulation Intractable?
Jessica Davies, Nina Narodytska, Toby Walsh
Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computat…
Complexity of and Algorithms for Borda Manipulation
Jessica Davies, George Katsirelos, Nina Narodytska +1
We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational…
An Empirical Study of Borda Manipulation
Jessica Davies, George Katsirelos, Nina Narodystka +1
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form of…