25 citations · 25 across the 1 of their papers we have counts for
2 papers
cs.AI2015
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…
cs.AI2011★ 25 cited
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…