Algorithmic Decision Theory Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings /

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 prefe...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Perny, Patrice (Επιμελητής έκδοσης), Pirlot, Marc (Επιμελητής έκδοσης), Tsoukiàs, Alexis (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
Σειρά:Lecture Notes in Computer Science, 8176
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • 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.  .