default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. ADT 2011: Piscataway, NJ, USA
- Ronen I. Brafman, Fred S. Roberts, Alexis Tsoukiàs:
Algorithmic Decision Theory - Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings. Lecture Notes in Computer Science 6992, Springer 2011, ISBN 978-3-642-24872-6 - Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe:
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. 1-15 - Ronen I. Brafman
, Ran Taig:
A Translation Based Approach to Probabilistic Conformant Planning. 16-27 - Charles Delort, Olivier Spanjaard, Paul Weng:
Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation. 28-41 - Thomas Dodson, Nicholas Mattei, Judy Goldsmith:
A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes. 42-55 - Stefan Eppe, Yves De Smet, Thomas Stützle:
A Bi-objective Optimization Model to Eliciting Decision Maker's Preferences for the PROMETHEE II Method. 56-66 - Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard:
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. 67-81 - Alain Guénoche:
Making Decisions in Multi Partitioning. 82-95 - Greg Hines, Kate Larson:
Efficiently Eliciting Preferences from a Group of Users. 96-107 - Ban Kawas, Marco Laumanns, Eleni Pratsini, Steve Prestwich:
Risk-Averse Production Planning. 108-120 - Christophe Labreuche, Nicolas Maudet, Wassila Ouerdane:
Minimal and Complete Explanations for Critical Multi-attribute Decisions. 121-134 - Tyler Lu, Craig Boutilier:
Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs. 135-149 - Radu Marinescu:
Efficient Approximation Algorithms for Multi-objective Constraint Optimization. 150-164 - Nicholas Mattei:
Empirical Evaluation of Voting Rules with Strictly Ordered Preference Data. 165-177 - Brice Mayag, Michel Grabisch, Christophe Labreuche:
A Reduction of the Complexity of Inconsistencies Test in the MACBETH 2-Additive Methodology. 178-189 - Wlodzimierz Ogryczak, Patrice Perny, Paul Weng:
On Minimizing Ordered Weighted Regrets in Multiobjective Markov Decision Processes. 190-204 - Sasa Pekec:
Scaling Invariance and a Characterization of Linear Objective Functions. 205-218 - Agnès Leroy, Vincent Mousseau, Marc Pirlot:
Learning the Parameters of a Multiple Criteria Sorting Method. 219-233 - Dmitry Podkopaev, Kaisa Miettinen:
Handling Preferences in the "Pre-conflicting" Phase of Decision Making Processes under Multiple Criteria. 234-246 - Anja Rey, Jörg Rothe:
Bribery in Path-Disruption Games. 247-261 - Theja Tulabandhula, Cynthia Rudin, Patrick Jaillet:
The Machine Learning and Traveling Repairman Problem. 262-276 - Paolo Viappiani, Sandra Zilles, Howard J. Hamilton, Craig Boutilier:
Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach. 277-291 - Toby Walsh:
Online Cake Cutting. 292-305 - XiaoJian Wu, Akshat Kumar, Shlomo Zilberstein:
Influence Diagrams with Memory States: Representation and Algorithms. 306-319 - Rong Yang, Milind Tambe, Manish Jain, Jun-young Kwak, James Pita, Zhengyu Yin:
Game Theory and Human Behavior: Challenges in Security and Sustainability. 320-330 - Jun Zheng, Olivier Cailloux, Vincent Mousseau:
Constrained Multicriteria Sorting Method Applied to Portfolio Selection. 331-343
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
