By Scientia Professor Toby Walsh

Preprints

Aziz H; Suksompong W; Sun Z; Walsh T, 2021, Fairness Concepts for Indivisible Items with Externalities, http://dx.doi.org/10.48550/arxiv.2110.09066

Bessiere C; Carbonnel C; Dries A; Hebrard E; Katsirelos G; Lazaar N; Narodytska N; Quimper C-G; Stergiou K; Tsouros DC; Walsh T, 2020, Partial Queries for Constraint Acquisition, http://dx.doi.org/10.48550/arxiv.2003.06649

Aziz H; Gaspers S; Sun Z; Walsh T, 2020, From Matching with Diversity Constraints to Matching with Regional Quotas, http://arxiv.org/abs/2002.06748v1

Frisch AM; Hnich B; Kiziltan Z; Miguel I; Walsh T, 2019, A Commentary on "Breaking Row and Column Symmetries in Matrix Models", http://dx.doi.org/10.48550/arxiv.1910.01423

Aziz H; Caragiannis I; Igarashi A; Walsh T, 2018, Fair allocation of combinations of indivisible goods and chores, http://dx.doi.org/10.48550/arxiv.1807.10684

Narodytska N; Kasiviswanathan SP; Ryzhyk L; Sagiv M; Walsh T, 2017, Verifying Properties of Binarized Deep Neural Networks, http://dx.doi.org/10.48550/arxiv.1709.06662

Aziz H; Goldberg P; Walsh T, 2017, Equilibria in Sequential Allocation, http://arxiv.org/abs/1705.09444v1

Lian JW; Mattei N; Noble R; Walsh T, 2017, The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods, http://arxiv.org/abs/1705.06840v1

Burton E; Goldsmith J; Koenig S; Kuipers B; Mattei N; Walsh T, 2017, Ethical Considerations in Artificial Intelligence Courses, http://arxiv.org/abs/1701.07769v1

Mattei N; Walsh T, 2016, Empirical Evaluation of Real World Tournaments

van Bevern R; Komusiewicz C; Molter H; Niedermeier R; Sorge M; Walsh T, 2016, h-Index Manipulation by Undoing Merges, http://dx.doi.org/10.48550/arxiv.1604.04827

Aziz H; Lev O; Mattei N; Rosenschein JS; Walsh T, 2016, Strategyproof Peer Selection using Randomization, Partitioning, and Apportionment, http://arxiv.org/abs/1604.03632v4

Aziz H; Rauchecker G; Schryen G; Walsh T, 2016, Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods, http://arxiv.org/abs/1604.01435v1

Abeliuk A; Aziz H; Berbeglia G; Gaspers S; Kalina P; Mattei N; Peters D; Stursberg P; Hentenryck PV; Walsh T, 2016, Interdependent Scheduling Games.

Bredereck R; Chen J; Niedermeier R; Walsh T, 2015, Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty, http://dx.doi.org/10.48550/arxiv.1509.02424

Aleksandrov M; Aziz H; Gaspers S; Walsh T, 2015, Online Fair Division: analysing a Food Bank problem, http://arxiv.org/abs/1502.07571v2

Aziz H; Gaspers S; Mackenzie S; Mattei N; Narodytska N; Walsh T, 2015, Equilibria Under the Probabilistic Serial Rule, http://arxiv.org/abs/1502.04888v2

Aziz H; Gaspers S; Mackenzie S; Mattei N; Narodytska N; Walsh T, 2015, Manipulating the Probabilistic Serial Rule, http://arxiv.org/abs/1501.06626v1

Aziz H; Walsh T, 2015, Algorithms for two variants of Satisfaction Approval Voting

van Bevern R; Komusiewicz C; Niedermeier R; Sorge M; Walsh T, 2014, H-Index Manipulation by Merging Articles: Models, Theory, and Experiments, http://dx.doi.org/10.48550/arxiv.1412.5498

Aziz H; Cahan C; Gretton C; Kilby P; Mattei N; Walsh T, 2014, A Study of Proxies for Shapley Allocations of Transport Costs, http://arxiv.org/abs/1408.4901v1

Aziz H; Brill M; Conitzer V; Elkind E; Freeman R; Walsh T, 2014, Justified Representation in Approval-Based Committee Voting, http://dx.doi.org/10.48550/arxiv.1407.8269

Aziz H; Gaspers S; Gudmundsson J; Mackenzie S; Mattei N; Walsh T, 2014, Computational Aspects of Multi-Winner Approval Voting, http://arxiv.org/abs/1407.3247v1

Narodytska N; Walsh T, 2014, The Computational Impact of Partial Votes on Strategic Voting, http://dx.doi.org/10.48550/arxiv.1405.7714

Aziz H; Gaspers S; Mattei N; Narodytska N; Walsh T, 2014, Strategic aspects of the probabilistic serial rule for the allocation of goods, http://dx.doi.org/10.48550/arxiv.1401.6523

Aziz H; Gaspers S; Mackenzie S; Walsh T, 2013, Fair assignment of indivisible objects under ordinal preferences, http://dx.doi.org/10.48550/arxiv.1312.6546

Narodytska N; Walsh T, 2013, Breaking Symmetry with Different Orderings, http://dx.doi.org/10.48550/arxiv.1306.5053

Mattei N; Narodytska N; Walsh T, 2013, How Hard Is It to Control an Election by Breaking Ties?, http://arxiv.org/abs/1304.6174v2

Narodytska N; Petit T; Siala M; Walsh T, 2013, Three Generalizations of the FOCUS Constraint, http://dx.doi.org/10.48550/arxiv.1304.5970

Gaspers S; Kalinowski T; Narodytska N; Walsh T, 2013, Coalitional Manipulation for Schulze's Rule, http://dx.doi.org/10.48550/arxiv.1304.0844

Narodytska N; Skocovsky P; Walsh T, 2013, Global SPACING Constraint (Technical Report), http://dx.doi.org/10.48550/arxiv.1303.6107

Grandi U; Loreggia A; Rossi F; Venable KB; Walsh T, 2013, Restricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency, http://dx.doi.org/10.48550/arxiv.1303.0787

Gaspers S; Naroditskiy V; Narodytska N; Walsh T, 2013, Possible and Necessary Winner Problem in Social Polls, http://dx.doi.org/10.48550/arxiv.1302.1669

Grandi U; Loreggia A; Rossi F; Venable KB; Walsh T, 2013, Restricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency, http://dx.doi.org/10.4204/eptcs.112.6

Katsirelos G; Narodytska N; Walsh T, 2012, The SeqBin Constraint Revisited, http://dx.doi.org/10.48550/arxiv.1207.1811

Narodytska N; Walsh T; Xia L, 2012, Combining Voting Rules Together, http://dx.doi.org/10.48550/arxiv.1203.3051

de Haan R; Narodytska N; Walsh T, 2012, The RegularGcc Matrix Constraint, http://dx.doi.org/10.48550/arxiv.1201.0564

Hnich B; Smith BM; Walsh T, 2011, Dual Modelling of Permutation and Injection Problems, http://dx.doi.org/10.48550/arxiv.1107.0038

Conitzer V; Walsh T; Xia L, 2011, Dominating Manipulations in Voting with Partial Information, http://dx.doi.org/10.48550/arxiv.1106.5448

Narodytska N; Walsh T; Xia L, 2011, Manipulation of Nanson's and Baldwin's Rules, http://dx.doi.org/10.48550/arxiv.1106.5312

Davies J; Katsirelos G; Narodytska N; Walsh T, 2011, Complexity of and Algorithms for Borda Manipulation, http://dx.doi.org/10.48550/arxiv.1105.5667

Drescher C; Eiter T; Fink M; Krennwallner T; Walsh T, 2011, Symmetry Breaking for Distributed Multi-Context Systems, http://dx.doi.org/10.48550/arxiv.1104.3931

Bessiere C; Narodytska N; Quimper C-G; Walsh T, 2011, The AllDifferent Constraint with Precedences, http://dx.doi.org/10.48550/arxiv.1103.3745

Walsh T, 2010, Parameterized Complexity Results in Symmetry Breaking, http://dx.doi.org/10.48550/arxiv.1009.1174

Balafoutis T; Paparrizou A; Stergiou K; Walsh T, 2010, Improving the Performance of maxRPC, http://dx.doi.org/10.48550/arxiv.1008.5189

Drescher C; Tifrea O; Walsh T, 2010, Symmetry-breaking Answer Set Solving, http://dx.doi.org/10.48550/arxiv.1008.1809

Pini MS; Rossi F; Venable B; Walsh T, 2010, Stable marriage problems with quantitative preferences, http://dx.doi.org/10.48550/arxiv.1007.5120

Davies J; Katsirelos G; Narodystka N; Walsh T, 2010, An Empirical Study of Borda Manipulation, http://dx.doi.org/10.48550/arxiv.1007.5104

Gelain M; Pini MS; Rossi F; Venable KB; Walsh T, 2010, Local search for stable marriage problems, http://dx.doi.org/10.48550/arxiv.1007.0859

Gelain M; Pini MS; RossI F; Venable KB; Walsh T, 2010, Local search for stable marriage problems with ties and incomplete lists, http://dx.doi.org/10.48550/arxiv.1007.0637

Back to profile page