2nd International Conference on Algorithmic Decision Theory

ADT2011 - Program:
Wednesday, October 26, 2011

 7:45 -  8:30  Breakfast and Registration

 8:30 -  8:45  Welcome

 8:45 - 10:00  Tutorial: Preference Learning 
               Eyke Hullermeier, Philipps-Universitat Marburg

10:00 - 10:30  Coffee Break

10:30 - 11:15  Research Challenge Talk: Game Theory and Human Behavior: Challenges in Security
               Milind Tambe, USC

11:15 - 12:45  Optimization

               Strategy-proof Mechanisms for Facility Location Games with Many Facilities
               Bruno Escoffier, Laurent Gourves, Kim-Thang Nguyen, 
               Fanny Pascual and Olivier Spanjaard
               Risk Averse Production Planning
               Ban Kawas, Marco Laumanns, Eleni Pratsini and Steve Prestwich

               Efficient Approximation Algorithms for Multi-objective Constraint Optimization
               Radu Marinescu

12:45 -  2:00  Lunch

 2:00 -  3:00  Invited Talk: Competitive Contagion in Networks
               Michael Kearns, University of Pennsylvania

 3:00 -  4:00  Explanation

               A Natural Language Argumentation Interface for Explanation
               Generation in Markov Decision Processes
               Thomas Dodson, Nicholas Mattei and Judy Goldsmith

               Minimal and Complete Explanations for Critical Multi-attribute Decisions
               Christophe Labreuche, Nicolas Maudet and Wassila Ouerdane

 4:00 -  4:30  Coffee Break

 4:30 -  6:00  Planning and decision making

               On Minimizing Ordered Weighted Regrets in Multiobjective Markov Decision Processes
               Wlodzimierz Ogryczak, Patrice Perny and Paul Weng

               A Translation Based Approach to Probabilistic Conformant Planning	
               Ran Taig and Ronen I. Brafman

               Influence Diagrams with Memory States: Representation and Algorithms
               Xiaojian Wu, Akshat Kumar and Shlomo Zilberstein

 6:15          Reception plus Banquet

Thursday, October 27, 2011

 7:45 -  8:30  Breakfast and Registration

 8:30 - 10:00  Subset selection

               Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation
               Charles Delort, Olivier Spanjaard and Paul Weng

               Constrained Multicriteria Sorting Method Applied to Portfolio Selection
               Jun Zheng, Olivier Cailloux and Vincent Mousseau

               Scaling Invariance and a Characterization of Linear Objective Functions
               Sasa Pekec

10:00 - 10:30  Coffee Break

10:30 - 11:15  Research Challenge Talk: Diversity Management: Research Challenges
               Marc Pirlot, University of Mons
11:15 - 12:45  Partitioning and MCDM

               Making decision in multi partitioning
               Alain Guenoche

               Online cake cutting
               Toby Walsh

               A reduction of the complexity of inconsistencies
               test in the MACBETH 2-additve methodology
               Brice Mayag, Michel Grabisch and Christophe Labreuche

12:45 -  2:00  Lunch

 2:00 -  3:00  Invited Talk: Commercializing Multi-Objective Project Portfolio Management Software: 
               Lessons and Opportunities
               Don Kleinmuntz, Strata Decision Technology LLC

 3:00 -  4:00  Voting

               Empirical Evaluation of Voting Rules with Strictly Ordered Preference Data
               Nicholas Mattei

               Vote Elicitation with Probabilistic Preference Models:
               Empirical Estimation and Cost Tradeoffs
               Tyler Lu and Craig Boutilier

 4:00 -  4:30  Coffee Break

 4:30 -  6:00  Learning

               Learning Complex Concepts using Crowdsourcing: A Bayesian Approach
               Paolo Viappiani, Sandra Zilles, Howard Hamilton and Craig Boutilier

               The Machine Learning and Traveling Repairman Problem
               Theja Tulabandhula, Cynthia Rudin and Patrick Jaillet 

               Learning the parameters of a multiple criteria sorting method based on a majority rule
	       Marc Pirlot, Vincent Mousseau and Agnes Leroy 

Friday, October 28, 2011

 7:45 -  8:30  Breakfast and Registration

 8:30 -  8:45  Welcome

 8:45 - 10:00  Tutorial: An Introduction to Preference Elicitation Using Utility Functions
               Patrice Perny, University Pierre and Marie Curie, Paris

10:00 - 10:30  Coffee Break

10:30 - 11:15  Research Challenge Talk: Taming Information Overload
               Carlos Guestrin, CMU

11:15 - 12:45  Elicitation

               Efficiently Eliciting Preferences from a Group of Users
               Greg Hines and Kate Larson

               An experimental multi-objective optimization approach to eliciting
               decision maker's preferences for the Promethee II method
               Stefan Eppe, Yves De Smet and Thomas Stuetzle

               Handling preferences in the "pre-conflicting" phase of the 
               decision making process under multiple criteria
               Dmitry Podkopaev and Kaisa Miettinen

12:45 -  2:00  Lunch

 2:00 -  3:00  Invited Talk: How to Play Repeated Games: Theory, an Algorithm, and Applications
               Rob Schapire, Princeton University

 3:00 -  4:00  Bribery

               How Hard is it to Bribe the Judges? A Study of the Complexity of
               Bribery in Judgment Aggregation
               Dorothea Baumeister, Gabor Erdelyi and Jorg Rothe

	       Bribery in Path-Disruption Games
               Anja Rey and Jorg Rothe

 4:00 -  5:00  Coffee Break + Business Meeting

Conference Poster