Algorithmic Decision Theory
Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings
Perny, Patrice.
editor.
Pirlot, Marc.
editor.
Tsoukiàs, Alexis.
editor.
SpringerLink (Online service)
text
gw
2013
monographic
eng
access
XII, 442 p. 96 illus. online resource.
This book constitutes the thoroughly refereed conference proceedings of the Third International Conference on Algorithmic Decision Theory, ADT 2013, held in November 2013 in Bruxelles, Belgium. The 33 revised full papers presented were carefully selected from more than 70 submissions, covering preferences in reasoning and decision making, uncertainty and robustness in decision making, multi-criteria decision analysis and optimization, collective decision making, learning and knowledge extraction for decision support.
Two Agents Competing for a Shared Machine -- Identification of a 2-Additive Bi-Capacity by Using Mathematical Programming -- How to Put through Your Agenda in Collective Binary Decisions -- Exact Approaches for Parameter Elicitation in Lexicographic Ordering -- Possible Winners in Approval Voting -- Computational Aspects of Manipulation and Control in Judgment Aggregation -- Property-Based Preferences in Abstract Argumentation -- Learning Multicriteria Utility Functions with Random Utility Models -- An Evolutionary Algorithm for the Biobjective Capacitated m-RingStar Problem -- Planning System for Emergency Services -- What Is a Decision Problem? Preliminary Statements -- Risk Information Extraction and Aggregation: Experimenting on Medline Abstracts -- How to Decrease the Degree of Envy in Allocations of Indivisible Goods -- Descriptive Profiles for Sets of Alternatives in Multiple Criteria Decision Aid -- Estimating Violation Risk for Fisheries Regulations -- Computing Convex Coverage Sets for Multi-objective Coordination Graphs -- Learning a Majority Rule Model from Large Sets of Assignment Examples -- Budgeted Personalized Incentive Approaches for Smoothing Congestion in Resource Networks -- Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems -- Thompson Sampling for Bayesian Bandits with Resets -- Robust Optimization of Recommendation Sets with the Maximin Utility Criterion -- Possible Winner Problems on Partial Tournaments: A Parameterized Study. .
edited by Patrice Perny, Marc Pirlot, Alexis Tsoukiàs.
Computer science
Computer communication systems
Computer programming
Algorithms
Mathematical statistics
Artificial intelligence
Computer Science
Artificial Intelligence (incl. Robotics)
Algorithm Analysis and Problem Complexity
Information Systems Applications (incl. Internet)
Probability and Statistics in Computer Science
Computer Communication Networks
Programming Techniques
Q334-342
TJ210.2-211.495
006.3
Springer eBooks
Lecture Notes in Computer Science, 8176
9783642415753
http://dx.doi.org/10.1007/978-3-642-41575-3
http://dx.doi.org/10.1007/978-3-642-41575-3
131028
20160413122537.0
sulb-eb0025642