DIMACS/LAMSADE Workshop on Computer Science and Decision Theory

October 27 - 29, 2004
University Paris Dauphine, France

Organizers:

Mel Janowitz, DIMACS, melj@dimacs.rutgers.edu

Fred Roberts, DIMACS, froberts@dimacs.rutgers.edu

Alexis Tsoukiās, LAMSADE, tsoukias@lamsade.dauphine.fr

DIMACS/LAMSADE PARTNERSHIP on Computer Science and Decision Theory: Applications of Notions of Consensus

LAMSADE Website

LAMSADE Working Group Website

Workshop Program:

Wednesday, October 27, 2004

 9:00 -  9:30  Registration

 9:30 -  9:50  Opening Session, Welcome

 9:50 - 10:40  Continuous Ordinal Clustering: A Mystery Story
               Mel F. Janowitz, DIMACS 

10:40 - 11:00  Coffee Break

11:00 - 11:50  A Computational Study of the Kemeny Rule for Preference Aggregation   
               Andrew Davenport and Jayant Kalagnanam, IBM 

11:50 - 12:40  Computation of median orders: complexity results 
               Olivier Hudry, Ecole Nationale Superieure des Telecommunications  

12:40 -  2:30  Lunch

 2:30 -  3:20  The majority rule and combinatorial geometry (via the symmetric group)    
               James Abello, DIMACS

 3:20 -  4:10  What can we learn from the transitivity parts of a relation?
               Jean Paul Doignon and Jean-Claude Falmagne

 4:10 -  4:30  Coffee Break

 4:30 -  5:20  Differential Approximation for MinSAT, MaxSAT and related problems      
               Bruno Escoffier and Vangelis T. Paschos, Lamsade   

 6:00	       Get together party

Thursday, October 28, 2004
 
 9:00 -  9:50  Graphical Models for Utility Elicitation
               Christophe Gonzales and Patrice Perny, University Paris 
      
 9:50 - 10:40  A Complete Description of Comparison Meaningful Functions    
               Jean-Luc Marichal and Radko Mesiar

10:40 - 11:00  Coffee Break

11:00 - 11:50  On some ordinal models for decision making under uncertainty
               Denis Bouyssou, CNRS and Marc Pirlot, Faculte Polytechnique de Mons, Belgium 

11:50 - 12:40  Preference aggregation with multiple criteria of ordinal significance   
               Raymond Bisdorff, University of Luxembourg  

12:40 -  2:30  Lunch

 2:30 -  3:20  Conciliation and Consensus in Iterated Belief Merging
               Olivier Gauwin, Sebastien Koniezny and Pierre Marquis

 3:20 -  4:10  Compact preference representation and computational 
               complexity in social choice
               Jerome Lang, IRIT  

 4:10 -  4:30  Coffee Break

 4:30 -  5:20  An algorithmic solution for an optimal decision making process 
               within emission trading markets
               Stefan Pickl, University of Cologne, Germany      

 8:00PM	       Dinner 

Friday, October 28, 2004

 9:00 -  9:50  May's theorem for trees     
               Buck McMorris and R.C. Powers

 9:50 - 10:40  On the consensus of closure systems     
               Bruno Leclerc, Centre d'Analyse et de Mathematique Sociales  

10:40 - 11:00  Coffee Break

11:00 - 11:50  Characterizing Neutral Aggregation on Restricted Domains   
               Eyal Beigman, Hebrew University  

11:50 - 12:40  Lattices of choice and consensus problems     
               Bernard Monjardet and Vololonirina Raderanirina, CERMSEM  

12:40 -  2:30  Lunch

 2:30 -  3:20  Competition Graphs of Semiorders
               Fred Roberts, DIMACS

 3:20 -  4:10  Multiagent Resource Allocation with k-additive Utility Functions    
               Yann Chevaleyre, Sylvia Estivie and Nicolas Maudet, Lamsade  
               Ulle Endriss, Imperial College

 4:10 -  4:30  Coffee Break

 4:30 -  5:20  Preferences On Intervals: a general framework
               Alexis Tsoukiās and Philippe Vincke, Lamsade  

 5:20 -  5:30  Closing session
 

Previous: Participation

Workshop Index

DIMACS Homepage