Algorithmic Decision Theory
Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings
Published on 12. October 2011
XI, 345 pages
978-3-642-24873-3 (ISBN)
Description
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.
More details
Other editions
Additional editions
RONEN BRAFMAN | Fred S. Roberts | Alexis Tsoukias
Algorithmic Decision Theory
Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings
Book
10/2011
Springer
€53.49
Shipment within 7-9 days
Content
- Intro
- Title
- Preface
- Organization
- Table of Contents
- How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation
- Introduction
- Preliminaries
- Problem Definitions
- Results
- Manipulation in Judgment Aggregation
- Bribery in Judgment Aggregation
- Conclusions
- References
- A Translation Based Approach to Probabilistic Conformant Planning
- Introduction
- Background
- Conformant Probabilistic Planning
- PFF
- Metric Planning and Metric-FF
- The Translation Approach
- Compiling CPP into Metric Planning
- The Metric Planning Problem
- Accuracy of Probabilistic Calculations
- Example
- Empirical Evaluation
- Summary
- References
- Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation
- Introduction
- From Ordinal Combinatorial Optimization to Multiobjective Optimization
- A Multiobjective Dynamic Programming Algorithm
- A Multiobjective Branch and Bound Algorithm
- Principle
- Branching Part
- Bounding Part
- Complexity
- Experimental Results
- Randomly Generated Instances
- IMDb Dataset
- Conclusion
- References
- A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes
- Introduction
- Background and Related Work
- Model
- System Overview
- Model Based Explanation
- Case-Based Explanation
- Natural Language Generator
- Discussion and Study Proposal
- Conclusion and Future Work
- References
- A Bi-objective Optimization Model to Eliciting Decision Maker's Preferences for the PROMETHEE II Method
- Introduction
- Experimental Setup
- Results
- Conclusion
- References
- Strategy-Proof Mechanisms for Facility Location Games with Many Facilities
- Introduction
- Facility Location Games
- Previous Work
- Contribution
- SP Mechanisms for General Metric Spaces
- Inversely Proportional Mechanism
- Lower Bounds on the Approximation Ratio for SP Mechanisms
- Randomized SP Mechanisms on Trees
- Preliminary Tool: Partition into Odd and Even Components
- A Randomized Mechanism
- Lower Bounds on the Approximation Ratio of SP Mechanisms
- Discussion and Further Directions
- References
- Making Decisions in Multi Partitioning
- Introduction
- Consensus Partition
- Consensus Formalization
- The Fusion-Transfer Method FT
- Tree Representation of Partitions
- X-Trees and Subtrees
- Adequacy of Both Methods
- Generation of More or Less Scattered Random Profiles
- Some Criteria
- Results
- Conclusions
- A Weak Consensus
- Subgroups of Experts
- References
- Efficiently Eliciting Preferences from a Group of Users
- Introduction
- The Model
- Types of Regret
- Elicitation Heuristics
- Hypothesis-Based Regret
- Rejecting Hypotheses
- Heuristics for Rejecting Hypotheses
- Experimental Results
- Using a Bayesian Approach with Probabilistic Regret
- Conclusion
- References
- Risk-Averse Production Planning
- Introduction
- Problem Setup
- The CVaR of the Net-Revenue of a Company under Non-compliance Risks
- Probability Distribution of the Inspection Process
- MINLP Formulation
- Branch-and-Bound Algorithm (BnB)
- Stochastic Constraint Programming (SCP)
- Numerical Experiments
- Conclusions
- References
- Minimal and Complete Explanations for Critical Multi-attribute Decisions
- Introduction
- Background and Basic Definitions
- Description of the Choice Problem
- Description of the Language for the Explanation
- Cost Function over the Explanations
- Minimal Complete Explanations
- Simple Language for S
- Factored Language for S
- Related Work and Conclusion
- References
- Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs
- Introduction
- Background
- Voting Rules
- Vote Elicitation
- Probabilistic Models of Population Preferences
- A Regret-Based Model of Probabilistic Vote Elicitation
- Probably Approximately Correct One-Round Protocols
- Empirical Results
- Concluding Remarks
- References
- Efficient Approximation Algorithms for Multi-objective Constraint Optimization
- Introduction
- Background
- Multi-objective Constraint Optimization
- Approximation of the Pareto Frontier
- AND/OR Search Spaces for MO-COPs
- Depth-First AND/OR Branch-and-Bound Search for Computing an -Covering of the Pareto Frontier
- Multi-objective AND/OR Branch-and-Bound Search
- Logarithmic Scaling Based Approximation
- A More Aggressive Approximation Algorithm
- Experiments
- Risk Conscious Combinatorial Auctions
- Scheduling Maintenance Tasks
- Conclusion
- References
- Empirical Evaluation of Voting Rules with Strictly Ordered Preference Data
- Introduction
- Related Work
- The Data
- Analysis and Discussion
- Domain Restrictions and Preference Cycles
- Voting Rules
- Statistical Models of Elections
- Conclusion
- References
- A Reduction of the Complexity of Inconsistencies Test in the MACBETH 2-Additive Methodology
- Introduction
- Basic Concepts
- Choquet Integral w.r.t. a 2-Additive Capacity
- Binary Actions and Relations
- The Representation of Ordinal Information by the Choquet Integral
- Reduction of the Complexity in the Inconsistencies Test of Ordinal Information
- Proof of Proposition 1
- References
- On Minimizing Ordered Weighted Regrets in Multiobjective Markov Decision Processes
- Introduction
- Background
- Fair Regret Optimization
- Solution Method
- Experimental Results
- Conclusion
- References
- Scaling Invariance and a Characterization of Linear Objective Functions
- Introduction
- The Choice Model
- The Main Theorem
- Optimal Aggregation
- Closing Remarks
- References
- Learning the Parameters of a Multiple Criteria Sorting Method
- Introduction
- MR-Sort: A Sorting Method Based on a Majority Rule
- Learning a MR-Sort Model
- The Case of Two Categories
- More Than 2 Categories
- Infeasible Learning Sets
- Empirical Design and Results
- Experiment 1: Model Retrieval
- Experiment 2: Tolerance for Error
- Experiment 3: Idiosyncratic Behavior
- Conclusion
- References
- Handling Preferences in the "Pre-conflicting" Phase of Decision Making Processes under Multiple Criteria
- Introduction and Problem Statement
- Direction of Proportional Improvement of Objectives
- Bounding Trade-Off Coefficients
- Global Trade-Off Approach
- B-Efficiency Approach
- Preference Model
- Application of the Preference Model
- Conclusions
- References
- Bribery in Path-Disruption Games
- Introduction
- Preliminaries
- Path-Disruption Games
- Bribery
- Complexity Results
- Conclusion and Future Work
- References
- The Machine Learning and Traveling Repairman Problem
- Introduction
- ML&TRP Formulations
- Optimization
- Experiments
- Generalization Bound
- Conclusion
- References
- Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach
- Introduction
- Bayesian Concept Learning Approach
- Concepts
- Query Types
- Expert Types
- Decision Making
- Inference
- Query Strategies
- Experiments
- Discussion and Future Work
- References
- Online Cake Cutting
- Introduction
- Online Cake Cutting
- Fairness Properties
- Online Properties
- Online Cut-and-Choose
- Online Moving Knife
- Online Collusion
- Online Cut-and-Choose
- Online Moving Knife
- Competitive Analysis
- Egalitarian Measure
- Utilitarian Measure
- Experimental Results
- Online Mark-and-Choose
- Related Work
- Conclusions
- References
- Influence Diagrams with Memory States: Representation and Algorithms
- Introduction
- Influence Diagram
- Influence Diagram with Memory States
- Approximate Policy Iteration for IDMS
- Bayes Net Mixture for IDMS
- The Expectation Maximization (EM) Algorithm
- Probabilities Computation
- Experiments
- Randomly Generated IDs
- Bayesian Networks Transformed into IDs
- The Effect of Memory States
- Conclusion
- References
- Game Theory and Human Behavior: Challenges in Security and Sustainability
- Introduction
- Security
- Background
- Challenges in Integrating Human Behavior Models
- Human Decision Making
- Robustness to Uncertainties in Attacker's Observation and Defender's Strategy Execution
- Modeling Challenge
- Addressing the Scalability Challenge
- Sustainability
- Conclusion
- References
- Constrained Multicriteria Sorting Method Applied to Portfolio Selection
- Introduction
- Problem Formulation
- Evaluating Alternatives with Electre Tri Method
- DMs' Preference on Alternatives
- DMs' Preference Information on Portfolios
- Mathematical Program Formulation
- Stating the Problem and Decision Variables
- Constraints Stemming from Preferences at Individual Level
- Constraints Stemming from Preferences at Portfolio Level
- Objective Function and Resolution Issues
- Illustrative Example
- Conclusion
- References
- Author Index
