Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithmic Decision Theory: 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25–27, 2017, Proceedings > Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems
Algorithmic Decision Theory: 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25–27, 2017, Proceedings |
Jörg Rothe
Springer International Publishing
Algorithmic Decision Theory: 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25–27, 2017, Proceedings
Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems
Authors

Maria Silvia Pini; Francesca Rossi; Kristen Brent Venable

ARI Id

1665081813160_4748234

Access

Not Available Free

Pages

333-338

DOI

10.1007/978-3-319-67504-6_23

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-67504-6_23

Table of Contents of Book
Showing 1 to 20 of 36 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XXIII
Front Matter
1-1
Constructive Preference Elicitation for Multiple Users with Setwise Max-margin
Stefano Teso; Andrea Passerini; Paolo Viappiani
3-17
Interactive Thompson Sampling for Multi-objective Multi-armed Bandits
Diederik M. Roijers; Luisa M. Zintgraf; Ann Nowé
18-34
Towards a Protocol for Inferring Preferences Using Majority-rule Sorting Models
Alexandru-Liviu Olteanu; Patrick Meyer; Ann Barcomb; Nicolas Jullien
35-49
Dominance Based Monte Carlo Algorithm for Preference Elicitation in the Multi-criteria Sorting Problem: Some Performance Tests
Tom Denat; Meltem Öztürk
50-64
A Heuristic Approach to Test the Compatibility of a Preference Information with a Choquet Integral Model
Lucie Galand; Brice Mayag
65-80
An Alternative View of Importance Indices for Multichoice Games
Mustapha Ridaoui; Michel Grabisch; Christophe Labreuche
81-92
Anytime Algorithms for Adaptive Robust Optimization with OWA and WOWA
Nadjet Bourdache; Patrice Perny
93-107
Fair Proportional Representation Problems with Mixture Operators
Hugo Gilbert
108-123
On the Complexity of Chamberlin-Courant on Almost Structured Profiles
Neeldhara Misra; Chinmay Sonar; P. R. Vaidyanathan
124-138
Learning Agents for Iterative Voting
Stéphane Airiau; Umberto Grandi; Filipo Studzinski Perotto
139-152
The Complexity of Campaigning
Cory Siler; Luke Harold Miles; Judy Goldsmith
153-165
Some Axiomatic and Algorithmic Perspectives on the Social Ranking Problem
Stefano Moretti; Meltem Öztürk
166-181
Complexity of Group Identification with Partial Information
Gábor Erdélyi; Christian Reger; Yongjie Yang
182-196
Multi-criteria Coalition Formation Games
Ayumi Igarashi; Diederik M. Roijers
197-213
Precise Complexity of the Core in Dichotomous and Additive Hedonic Games
Dominik Peters
214-227
The Subset Sum Game Revisited
Astrid Pieterse; Gerhard J. Woeginger
228-240
Higher-Order Decision Theory
Jules Hedges; Paulo Oliva; Evguenia Shprits; Viktor Winschel; Philipp Zahn
241-254
On Simplified Group Activity Selection
Andreas Darmann; Janosch Döcker; Britta Dorn; Jérôme Lang; Sebastian Schneckenburger
255-269
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 36 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings