By Scientia Professor Toby Walsh

Journal articles

Walsh T, 2018, 'Expert and Non-expert Opinion About Technological Unemployment', International Journal of Automation and Computing, 15, pp. 637 - 642, http://dx.doi.org/10.1007/s11633-018-1127-x

Aziz H; Gaspers S; Mackenzie S; Mattei N; Stursberg P; Walsh T, 2018, 'Fixing balanced knockout and double elimination tournaments', Artificial Intelligence, 262, pp. 1 - 14, http://dx.doi.org/10.1016/j.artint.2018.05.002

Walsh T, 2018, 'The new robber barons', AI Matters, 4, pp. 25 - 26, http://dx.doi.org/10.1145/3236644.3236651

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

Lian JW; Mattei N; Noble R; Walsh T, 2018, 'The conference paper assignment problem: Using order weighted averages to assign indivisible goods', 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, pp. 1138 - 1145

Walsh T, 2017, 'The singularity may never be near', AI Magazine, 38, pp. 58 - 62, http://dx.doi.org/10.1609/aimag.v38i3.2702

Burton E; Goldsmith J; Koenig S; Kuipers B; Mattei N; Walsh T, 2017, 'Ethical considerations in artificial intelligence courses', AI Magazine, 38, pp. 22 - 34, http://dx.doi.org/10.1609/aimag.v38i2.2731

Fischetti M; Liberti L; Salvagnin D; Walsh T, 2017, 'Orbital shrinking: Theory and applications', Discrete Applied Mathematics, 222, pp. 109 - 123, http://dx.doi.org/10.1016/j.dam.2017.01.015

Bredereck R; Chen J; Niedermeier R; Walsh T, 2017, 'Parliamentary voting procedures: Agenda control, manipulation, and uncertainty', Journal of Artificial Intelligence Research, 59, pp. 133 - 173, http://dx.doi.org/10.1613/jair.5407

Aziz H; Brill M; Conitzer V; Elkind E; Freeman R; Walsh T, 2017, 'Justified representation in approval-based committee voting', Social Choice and Welfare, 48, pp. 461 - 485, http://dx.doi.org/10.1007/s00355-016-1019-3

Walsh T, 2016, 'Author responds', Communications of the ACM, 59, pp. 17, http://dx.doi.org/10.1145/3013930

Walsh T, 2016, 'More Than a Red Flag for AIs Reply', COMMUNICATIONS OF THE ACM, 59, pp. 17 - 17, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000391635300030&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Walsh T, 2016, 'What if… We create human-level artificial intelligence?', New Scientist, 232, pp. 32 - 34, http://dx.doi.org/10.1016/S0262-4079(16)32126-1

van Bevern R; Komusiewicz C; Niedermeier R; Sorge M; Walsh T, 2016, 'H-index manipulation by merging articles: Models, theory, and experiments', Artificial Intelligence, 240, pp. 19 - 35, http://dx.doi.org/10.1016/j.artint.2016.08.001

Narodytska N; Petit T; Siala M; Walsh T, 2016, 'Three generalizations of the FOCUS constraint', Constraints, 21, pp. 495 - 532, http://dx.doi.org/10.1007/s10601-015-9233-7

Walsh T, 2016, 'More to Asimov's first law: Author Responds', Communications of the ACM, 59, pp. 9, http://dx.doi.org/10.1145/2977335

Walsh T, 2016, 'Unintended consequences of trusting ais: Author Responds', Communications of the ACM, 59, pp. 8, http://dx.doi.org/10.1145/2977335

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

Aziz H; Cahan C; Gretton C; Kilby P; Mattei N; Walsh T, 2016, 'A study of proxies for shapley allocations of transport costs', Journal of Artificial Intelligence Research, 56, pp. 573 - 611, http://dx.doi.org/10.1613/jair.5021

Walsh T, 2016, 'Turing's red flag', Communications of the ACM, 59, pp. 34 - 37, http://dx.doi.org/10.1145/2838729

Aziz H; Rauchecker G; Schryen G; Walsh T, 2016, 'Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods',

Eaton E; Dietterich T; Gini M; Grosz BJ; Isbell CL; Kambhampati S; Littman M; Rossi F; Russell S; Stone P; Walsh T; Wooldridge M, 2016, 'Who speaks for AI?', AI Matters, 2, pp. 4 - 14, http://dx.doi.org/10.1145/2847557.2847559

Aziz H; Gaspers S; Mackenzie S; Walsh T, 2015, 'Two Desirable Fairness Concepts for Allocation of Indivisible Objects under Ordinal Preferences', ACM SIGECOM EXCHANGES, 14, pp. 16 - 21, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000372616400002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Aziz H; Gaspers S; Mackenzie S; Walsh T, 2015, 'Fair assignment of indivisible objects under ordinal preferences', Artificial Intelligence, 227, pp. 71 - 92, http://dx.doi.org/10.1016/j.artint.2015.06.002

Albrecht SV; Beck JC; Buckeridge DL; Botea A; Caragea C; Chi CH; Damoulas T; Dilkina B; Eaton E; Fazli P; Ganzfried S; Giles CL; Guillet S; Holte R; Hutter F; Koch T; Leonetti M; Lindauer M; Machado MC; Malitsky Y; Marcus G; Meijer S; Rossi F; Shaban-Nejad A; Thiebaux S; Veloso M; Walsh T; Wang C; Zhang J; Zheng Y, 2015, 'Reports on the 2015 AAAI workshop series', AI Magazine, 36, pp. 90 - 101, http://dx.doi.org/10.1609/aimag.v36i2.2590

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

Aziz H; Gaspers S; Mackenzie S; Walsh T, 2015, 'Fair assignment of indivisible objects under ordinal preferences.', Artif. Intell., 227, pp. 71 - 92, http://dx.doi.org/10.1016/j.artint.2015.06.002

Walsh T, 2014, 'Candy crushs puzzling mathematics', American Scientist, 102, pp. 430 - 433, http://dx.doi.org/10.1511/2014.111.430

Davies J; Katsirelos G; Narodytska N; Walsh T; Xia L, 2014, 'Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules', Artificial Intelligence, 217, pp. 20 - 42, http://dx.doi.org/10.1016/j.artint.2014.07.005

Gelain M; Pini MS; Rossi F; Venable KB; Walsh T, 2013, 'Local search approaches in stable matching problems', Algorithms, 6, pp. 591 - 617, http://dx.doi.org/10.3390/a6040591

Pini MS; Rossi F; Brent Venable K; Walsh T, 2013, 'Stability, optimality and manipulation in matching problems with weighted preferences', Algorithms, 6, pp. 782 - 804, http://dx.doi.org/10.3390/a6040782

Narodytska N; Skocovsky P; Walsh T, 2013, 'Global SPACING Constraint (Technical Report)', ArXiv, https://arxiv.org/abs/1303.6107

Walsh T, 2013, 'Look beyond north america', Communications of the ACM, 56, pp. 10 - 11, http://dx.doi.org/10.1145/2436256.2436259

Grandi U; Loreggia A; Rossi F; Venable KB; Walsh T, 2013, 'Restricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency', Electronic Proceedings in Theoretical Computer Science, 112, pp. 17 - 24, http://dx.doi.org/10.4204/eptcs.112.6

Pini MS; Rossi F; Venable KB; Walsh T, 2013, 'Stability and Optimality in Matching Problems with Weighted Preferences', Communications in Computer and Information Science, 271, pp. 319 - 333, http://dx.doi.org/10.1007/978-3-642-29966-7_21

Barnes N; Baumgartner P; Caetano T; Durrant-Whyte H; Klein G; Sanderson P; Sattar A; Stuckey P; Thiebaux S; Van Hentenryck P; Walsh T, 2012, 'AI@NICTA', AI Magazine, 33, pp. 115 - 127, http://dx.doi.org/10.1609/aimag.v33i3.2430

Walsh T, 2011, 'Is computational complexity a barrier to manipulation?', Annals of Mathematics and Artificial Intelligence, 62, pp. 7 - 26, http://dx.doi.org/10.1007/s10472-011-9255-9

Yaman F; Walsh TJ; Littman ML; Desjardins M, 2011, 'Democratic approximation of lexicographic preference models', ARTIFICIAL INTELLIGENCE, 175, pp. 1290 - 1307, http://dx.doi.org/10.1016/j.artint.2010.11.012

Pini MS; Rossi F; Venable KB; Walsh T, 2011, 'Incompleteness and incomparability in preference aggregation: Complexity results', Artificial Intelligence, 175, pp. 1272 - 1289, http://dx.doi.org/10.1016/j.artint.2010.11.009

Pini MS; Rossi F; Venable K; Walsh T, 2011, 'Manipulation complexity and gender neutrality in stable marriage procedures', Autonomous Agents and Multi - Agent Systems, 22, pp. 183 - 199, http://dx.doi.org/10.1007/s10458-010-9121-x

Balafoutis ; Paparrizou A; Stergiou K; Walsh T, 2011, 'New algorithms for max restricted path consistency', Constraints, 16, pp. 372 - 406, http://dx.doi.org/10.1007/s10601-011-9110-y

Drescher C; Tifrea O; Walsh T, 2011, 'Symmetry-breaking answer set solving', AI Communications, 24, pp. 177 - 194, http://dx.doi.org/10.3233/AIC-2011-0495

Walsh T, 2011, 'Where are the hard manipulation problems?', Journal of Artificial Intelligence Research, 42, pp. 1 - 29, http://dx.doi.org/10.1613/jair.3223

Drescher C; Walsh T, 2010, 'A translational approach to constraint answer set solving', Theory and Practice of Logic Programming, 10, pp. 465 - 480, http://dx.doi.org/10.1017/S1471068410000220

Gelain M; Pini MS; Rossi F; Venable K; Walsh T, 2010, 'Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies', Artificial Intelligence, 174, pp. 270 - 294, http://dx.doi.org/10.1016/j.artint.2009.11.015

Pini M; Rossi F; Venable K; Walsh T, 2009, 'Aggregating Partially Ordered Preferences', Journal of Logic and Computation, 19, pp. 475 - 502, http://dx.doi.org/10.1093/logcom/exn012

Pini MS; Rossi F; Venable B; Walsh T, 2009, 'Aggregating partially ordered preferences: fairness and startegy proofness', Journal of Logic and Computation, 19, pp. 475 - 502, http://dx.doi.org/10.1093/logcom/exn012

Miguel I; Frisch A; Hnich B; Kiziltan Z; Walsh T, 2009, 'Filtering Algorithms for the MultiSet Ordering Constraint', Artificial Intelligence, 173 (2009), pp. 299 - 328, http://dx.doi.org/10.1016/j.artint.2008.11.001

Bessiere C; Hebrard E; Hnich B; Kiziltan Z; Walsh T, 2009, 'Range and Roots: Two Common patterns for specifying and propagating, counting and occurence constraints', Artificial Intelligence, 173, pp. 1054 - 1078, http://dx.doi.org/10.1016/j.artint.2009.03.001

Bessiere C; Stergiou K; Walsh T, 2008, 'Domain filtering consistencies for non-binary constraints', Artificial Intelligence, 172, pp. 800 - 822, http://dx.doi.org/10.1016/j.artint.2007.10.016

Back to profile page