201 citations · 1.5k across the 125 of their papers we have counts for
8 papers · 2 filters
Dual Modelling of Permutation and Injection Problems
B. Hnich, B. M. Smith, T. Walsh
When writing a constraint program, we have to choose which variables should be the decision variables, and how to represent the constraints on these variables. In many cases, there…
A Comparison of Lex Bounds for Multiset Variables in Constraint Programming
Yat-Chiu Law, Jimmy Ho-Man Lee, May Hiu-Chun Woo +1
Set and multiset variables in constraint programming have typically been represented using subset bounds. However, this is a weak representation that neglects potentially useful in…
Dominating Manipulations in Voting with Partial Information
Vincent Conitzer, Toby Walsh, Lirong Xia
We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information…
Online Cake Cutting (published version)
Toby Walsh
We propose an online form of the cake cutting problem. This models situations where agents arrive and depart during the process of dividing a resource. We show that well known fair…
Manipulation of Nanson's and Baldwin's Rules
Nina Narodytska, Toby Walsh, Lirong Xia
Nanson's and Baldwin's voting rules select a winner by successively eliminating candidates with low Borda scores. We show that these rules have a number of desirable computational…
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…