Algorithmic Decision Theory

1. Front Matter

   PDF

2. How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation

   • Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe

   Pages 1-15

3. A Translation Based Approach to Probabilistic Conformant Planning

   • Ronen I. Brafman, Ran Taig

   Pages 16-27

4. Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation

   • Charles Delort, Olivier Spanjaard, Paul Weng

   Pages 28-41

5. A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes

   • Thomas Dodson, Nicholas Mattei, Judy Goldsmith

   Pages 42-55

6. A Bi-objective Optimization Model to Eliciting Decision Maker’s Preferences for the PROMETHEE II Method

   • Stefan Eppe, Yves De Smet, Thomas Stützle

   Pages 56-66

7. Strategy-Proof Mechanisms for Facility Location Games with Many Facilities

   • Bruno Escoffier, Laurent Gourvès, Nguyen Kim Thang, Fanny Pascual, Olivier Spanjaard

   Pages 67-81

8. Making Decisions in Multi Partitioning

   • Alain Guénoche

   Pages 82-95

9. Efficiently Eliciting Preferences from a Group of Users

   • Greg Hines, Kate Larson

   Pages 96-107

10. Risk-Averse Production Planning

    • Ban Kawas, Marco Laumanns, Eleni Pratsini, Steve Prestwich

    Pages 108-120

11. Minimal and Complete Explanations for Critical Multi-attribute Decisions

    • Christophe Labreuche, Nicolas Maudet, Wassila Ouerdane

    Pages 121-134

12. Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs

    • Tyler Lu, Craig Boutilier

    Pages 135-149

13. Efficient Approximation Algorithms for Multi-objective Constraint Optimization

    • Radu Marinescu

    Pages 150-164

14. Empirical Evaluation of Voting Rules with Strictly Ordered Preference Data

    • Nicholas Mattei

    Pages 165-177

15. A Reduction of the Complexity of Inconsistencies Test in the MACBETH 2-Additive Methodology

    • Brice Mayag, Michel Grabisch, Christophe Labreuche

    Pages 178-189

16. On Minimizing Ordered Weighted Regrets in Multiobjective Markov Decision Processes

    • Wlodzimierz Ogryczak, Patrice Perny, Paul Weng

    Pages 190-204

17. Scaling Invariance and a Characterization of Linear Objective Functions

    • Saša Pekeč

    Pages 205-218

18. Learning the Parameters of a Multiple Criteria Sorting Method

    • Agnès Leroy, Vincent Mousseau, Marc Pirlot

    Pages 219-233

19. Handling Preferences in the ”Pre-conflicting” Phase of Decision Making Processes under Multiple Criteria

    • Dmitry Podkopaev, Kaisa Miettinen

    Pages 234-246

20. Bribery in Path-Disruption Games

    • Anja Rey, Jörg Rothe

    Pages 247-261

This book constitutes the refereed proceedings of the Second International Conference on Algorithmic Decision Theory, ADT 2011, held in Piscataway, NJ, USA, in October 2011. The 24 revised full papers presented were carefully reviewed and selected from 50 submissions.

• combinatorial optimization
• learning methods
• preference modeling
• risk management
• voting
• algorithm analysis and problem complexity

• Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel

  Ronen I. Brafman

• DIMACS, Rutgers University, Piscataway, USA

  Fred S. Roberts

• CNRS - LAMSADE, Université Paris Dauphine, Paris, France

  Alexis Tsoukiàs

Policies and ethics