7th Multidisciplinary Workshop on

Advances in Preference Handling

 

Invited Speaker: Toby Walsh, NICTA and University of New South Wales, Australia

Title: PrefLib: a library of preferences

Bio: Toby Walsh is the Scientific Director of NICTA, Australia’s centre of excellence for ICT research. He is adjunct Professor at the University of New SouthWales, external Professor at Uppsala University and an honorary fellow of Edinburgh University. He has been Editor-in-Chief of the Journal of Artificial Intelligence Research, and of AI Communications. He is both an AAAI and an ECCAI fellow. He has been Secretary of the Association for Constraint Programming (ACP) and is Editor of CP News, the newsletter of the ACP. He is one of the Editors of the Handbook for Constraint Programming. He is also an Editor of the Handbook for Satisfiability. He has been Program Chair of CP 2001, Conference Chair of IJCAR 2004, Program and Conference Chair of SAT 2005, Conference Chair of CP 2008, and Program Chair of IJCAI 2011.



The talks are 20min + 5min for questions and answers. The workshop program can also be downloaded as PDF.

09:00 - 09:15 Welcome



1. Session: Conditional Preferences

9:15 - 9:40  Dynamic Probabilistic CP-nets. Cristina Cornelio, Judy Goldsmith, Nicholas Mattei, Francesca Rossi and K. Brent Venable


9:40 - 10:05  A Parameterized Complexity Analysis of Generalized CP-Nets. Martin Kronegger, Martin Lackner, Andreas Pfandler and Reinhard Pichler


10:05 - 10:30 Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers. Xudong Liu and Miroslaw Truszczynski



10:30 - 10:45 Coffee Break



2. Session: Preference Learning, Games and Matching Problems

10:45 - 11:10 Soft Constraints in Stable Matching Problems Maria Silvia Pini, Francesca Rossi and Kristen Brent Venable


11:10 - 11:35 Roles and Teams Hedonic Games. Matthew Spradling, Judy Goldsmith, Xudong Liu, Chandrima Dadi and Zhiyu Li


11:35 - 12:00 A Nearest Neighbor Approach to Label Ranking based on Generalized Labelwise Loss Minimization. Weiwei Cheng and Eyke Huellermeier.



3. Session: Voting

12:00 - 12:25 How Hard is it to Control an Election by Breaking Ties?. Nicholas Mattei, Nina Narodytska and Toby Walsh



12:30 - 13:30 Lunch



3. Session continued

13:30 - 13:55 Complexity of Control Behaviors in k-Peaked Elections for a Variant of Approval Voting. Yongjie Yang and Jiong Guo


13:55 - 14:20 Incomplete Preferences in Single-Peaked Electorates. Martin Lackner


14:20 - 14:55 Binary Aggregation by Selection of the Most Representative Voter. Ulle Endriss and Umberto Grandi


14:55 - 15:20 Restricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda . Umberto Grandi, Andrea Loreggia, Francesca Rossi, Kristen Brent Venable and Toby Walsh



15:20 - 15:30 Coffee Break



Invited Talk

15:30 - 16:15 Toby Walsh: PrefLib: a library of preferences.



4. Session: Resource Allocation and Auctions

16:15 - 16:40 A Parallel Elicitation-Free Protocol for Allocating Indivisible Goods. Wei Huang, Jian Lou and Zhonghua Wen


16:40 - 17:05 Allocating Indivisible Resources under Price Rigidities in Polynomial Time. Wei Huang, Jian Lou and Zhonghua Wen


17:05 - 17:30 Auctioning License Plate Numbers. Loizos Michael and Demetra Stavrou



17:30 - 17:35 End of the Workshop


PROGRAM (August 4th)