Algorithmic Decision Theory
6th International Conference, ADT 2019, Durham, NC, USA, October 25-27, 2019, Proceedings
Published on 10. October 2019
VIII, 181 pages
978-3-030-31489-7 (ISBN)
Description
This book constitutes the conference proceedings of the 6th International Conference on Algorithmic Decision Theory, ADT 2019, held in Durham, NC, USA, in October 2019. The 10 full papers presented together with 7 short papers were carefully selected from 31 submissions. The papers focus on algorithmic decision theory broadly defined, seeking to bring together researchers and practitioners coming from diverse areas of computer science, economics and operations research in order to improve the theory and practice of modern decision support.
More details
Series
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Product notice
Reflowable
Illustrations
VIII, 181 p. 578 illus., 18 illus. in color.
File size
6,39 MB
ISBN-13
978-3-030-31489-7 (9783030314897)
DOI
10.1007/978-3-030-31489-7
Schweitzer Classification
Other editions
Additional editions
Sasa Pekec | Kristen Brent Venable
Algorithmic Decision Theory
6th International Conference, ADT 2019, Durham, NC, USA, October 25-27, 2019, Proceedings
Book
09/2019
Springer
€53.49
Shipment within 7-9 days
Content
- Intro
- Preface
- Organization
- Contents
- Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization
- 1 Introduction
- 2 Background and Notations
- 2.1 Multi-Objective Combinatorial Optimization
- 2.2 Regret-Based Incremental Elicitation
- 3 An Interactive Local Search Algorithm
- 4 Numerical Tests
- 4.1 Preferences Represented by a Weighted Sum
- 4.2 Preferences Represented by an OWA Aggregator
- 5 Conclusion
- References
- Robustness of Approval-Based Multiwinner Voting Rules
- 1 Introduction
- 2 Preliminaries
- 3 Robustness Levels
- 4 Complexity of the Robustness Radius Problems
- 4.1 The AV Rule: Polynomial-Time Algorithms
- 4.2 The SAV Rule: Easy Decision Problems, Hard Counting Ones
- 4.3 Unit-Decreasing Thiele Rules: Hardness and FPT Algorithms
- 5 Conclusion and Further Work
- References
- Towards Characterizing the Deterministic Combinatorial Constrained Efficient Space
- 1 Introduction
- 1.1 Our Contribution
- 1.2 Prior Literature
- 2 Notation and Definitions
- 3 Impossibility Space - No VCG Mechanisms
- 4 Possibility Space - Dictatorial Mechanisms
- 4.1 When R3 Is Publicly Known
- 4.2 When R4 Is Publicly Known
- 5 Concluding Remarks
- References
- Integrating Operators' Preferences into Decisions of Unmanned Aerial Vehicles: Multi-layer Decision Engine and Incremental Preference Elicitation
- 1 Introduction
- 2 State of the Art
- 2.1 Decisions in Autonomous UAVs
- 2.2 Multi-Criteria Decision Aiding and (incremental) Preference Elicitation
- 3 Onboard Multi-layer Decision Engine
- 4 The Multi-Criteria Decision Aiding Model
- 4.1 Simple Ranking Method Using Reference Profiles (SRMP)
- 4.2 Illustrative Example
- 4.3 Incremental Preference Elicitation for SRMP Models
- 5 Experimental Validation of the Decision Model
- 6 Conclusion and Perspectives
- References
- Refugee Allocation in the Setting of Hedonic Games
- 1 Introduction
- 2 Basics
- 2.1 Matching Problems with Feasibility Constraints
- 2.2 Refugee Allocation Problems
- 2.3 Properties of Allocations
- 3 A Fresh Look at the RAP
- 3.1 Hedonic Games
- 3.2 RAP as a Hedonic Game
- 3.3 Set Extensions
- 3.4 Stability in RAPs, FeaCoMPs, and Hedonic Games
- 4 Conclusions
- References
- Optimizing Social Welfare in Social Networks
- 1 Introduction
- 2 Preliminaries
- 3 Social Welfare on Graph-Envy-Free Allocations
- 4 Graph-Envy-Free Allocations Through Rational Trades
- 5 Conclusions and Open Questions
- References
- New Complexity Results on Aggregating Lexicographic Preference Trees Using Positional Scoring Rules
- 1 Introduction
- 2 Technical Preliminaries
- 3 Computing Ranks
- 4 The Problems and Their Complexity
- 4.1 k-Approval
- 4.2 b-Borda
- 5 Conclusions and Future Work
- References
- On the Parameterized Complexity of Party Nominations
- 1 Introduction
- 1.1 Related Work and Our Results
- 1.2 Methodology
- 2 Preliminaries
- 2.1 Notations and Definitions
- 2.2 Problem Definitions
- 3 Possible President
- 3.1 Parameterized Complexity Results
- 3.2 The Case of Small Parties
- 4 Necessary President
- 5 Concluding Remarks
- References
- Gradient Methods for Solving Stackelberg Games
- 1 Introduction
- 2 Stackelberg Games
- 3 Solution Method
- 3.1 Backward Solution
- 3.2 Forward Solution
- 4 Experiments
- 4.1 Conceptual Example
- 4.2 An Application to Adversarial Regression
- 5 Discussion
- A Proof of the Adjoint Method
- References
- Interactive Elicitation of a Majority Rule Sorting Model with Maximum Margin Optimization
- 1 Introduction
- 2 Background
- 3 Learning a MR-Sort Model from Assignments
- 3.1 Possible Categories
- 3.2 Maximum Margin Optimization
- 4 Incremental MR-sort
- 4.1 Main Framework
- 4.2 Question Selection Strategies
- 5 Experiments
- 6 Conclusions
- References
- Short Papers
- Approximating the Pareto Front of Bi-Criteria Kidney Exchanges
- References
- Formal Property-Oriented Design of Voting Rules Using Composable Modules
- 1 Introduction
- 2 Property-Oriented Composition of Voting Rules
- 3 Related Work, Conclusion and Outlook
- References
- The Complexity of Elections with Rational Actors
- 1 The Model
- 2 Summary
- References
- An Approach to Approximating Dominance in CP-nets
- 1 Introduction
- 2 Approach
- References
- Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation
- References
- Application of Boolean Logic to Natural Language Complexity in Political Discourse
- References
- Integrating Multiple Contexts into Multi-criteria Majority-Rule Sorting
- References
- Author Index
