DIMACS Workshop on Polyhedral Combinatorics of Random Utility

May 24 - 26, 2006
DIMACS Center, CoRE Building, Rutgers University

Organizers:
Jean-Paul Doignon, Univ. Libre de Bruxelles, doignon@ulb.ac.be
Aleksandar Pekec, Fuqua School of Business, Duke University, pekec@duke.edu
Presented under the auspices of the Special Focus on Computation and the Socio-Economic Sciences.

This workshop is dedicated to the memory of Yehuda Vardi, Professor of Statistics, Rutgers University.


Workshop Program:

Wednesday, May 24, 2006

 9:30 - 10:30  Registration and breakfast

10:30 - 10:45  Welcome and Opening Remarks
               Brenda Latka, DIMACS Associate Director

10:45 - 11:30  Theory Axioms, Mixture Models and Convex Polytopes
               Michel Regenwetter, University of Illinois at Urbana-Champaign

11:30 - 11:45  Break

11:45 - 12:30  Frequentist Axiom Testing: Analysis of Choice Data
               Under Convex Polytope Constraints
               Clint Davis-Stober, University of Illinois at Urbana-Champaign

12:30 -  2:00  Lunch

 2:00 -  2:45  The Interval Order Polytope of a Digraph
               Andreas S. Schulz, Massachusetts Institute of Technology
               Sloan school of Management

 2:45 -  3:30  Block-Marschak Type Conditions for Incomplete Choice Probabilities
               Reinhard Suck, University of Osnabreck, FRG

 3:30 -  4:00  Break

 4:00 -  4:45  Approximate Sorting
               Eva Schuberth, ETH Zurich

 4:45 -  5:30  Vertices and Facets of the Semiorder Polytope
               Barry Balof, Whitman College

 5:30          Dinner

Thursday, May 25, 2006

 9:30 - 10:00  Breakfast and Registration

10:00 - 10:45  Graphical Inequalities for the Linear Ordering Polytope
               Jean-Paul Doignon, Universite Libre de Bruxelles

10:45 - 11:30  On Weighted Graphs Yielding Facets of the Linear Ordering Polytope
               GwenaŽl Joret,Universite Libre de Bruxelles

11:30 - 12:00  Break

12:00 - 12:45  Surfaces that Define Facets of the Linear Ordering Polytope
               Samuel Fiorini, Universite Libre de Bruxelles

12:45 -  2:00  Lunch

 2:00 -  2:45  Bayesian Elicitation of Structured Multiattribute Utility Models
               Darius Braziunas and Craig Boutilier, University of Toronto

 2:45 -  3:30  Regret-based Partial Revelation Mechanisms
               Nathanael Hyafil and Craig Boutilier, University of Toronto

 3:30 -  4:00  Break

 4:00 -  4:45  Polyhedral Sampling for Multiattribute Preference Elicitation
               S. Ghosh and Jayant R. Kalagnanam, IBM T.J. Watson Research Center

Friday, May 26, 2006

 9:30 - 10:00  Breakfast and Registration

10:00 - 10:45  Borda Scores and Aggregation of Preference: A
               Geometric-Combinatoric and a Topological Approach
               Jun Zhang, University of Michigan, Ann Arbor

10:45 - 11:30  Mediatic Graphs
               Jean-Claude Falmagne, University of California, Irvine

11:30 - 12:00  Break

12:00 - 12:45  An Open Problem: Characterizing Random Utility Models of Best-Worst Choice
               Tony Marley, University of Victoria and
               J.J. Louviere, University of Technology, Sydney

12:45 -  1:00  Concluding session

 1:00          Lunch



Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on May 22, 2006.