- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity
Artificial Intelligence 276 (C):57-78 (2019)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Approximating optimal social choice under metric preferences.Elliot Anshelevich, Onkar Bhardwaj, Edith Elkind, John Postl & Piotr Skowron - 2018 - Artificial Intelligence 264 (C):27-51.
State-variable planning under structural restrictions: algorithms and complexity.Peter Jonsson & Christer Bäckström - 1998 - Artificial Intelligence 100 (1-2):125-176.
Optimal schedules for monitoring anytime algorithms.Lev Finkelstein & Shaul Markovitch - 2001 - Artificial Intelligence 126 (1-2):63-108.
Multi resource allocation with partial preferences.Haibin Wang, Sujoy Sikdar, Xiaoxi Guo, Lirong Xia, Yongzhi Cao & Hanpin Wang - 2023 - Artificial Intelligence 314 (C):103824.
Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation.Wanlei Wang, Jian-Jun Wang & Ji-Bo Wang - 2021 - Complexity 2021:1-13.
Algorithms and mechanisms for procuring services with uncertain durations using redundancy.S. Stein, E. H. Gerding, A. C. Rogers, K. Larson & N. R. Jennings - 2011 - Artificial Intelligence 175 (14-15):2021-2060.
Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs.Tal Grinshpoun, Tamir Tassa, Vadim Levit & Roie Zivan - 2019 - Artificial Intelligence 266 (C):27-50.
Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting.Thomas Lukasiewicz & Enrico Malizia - 2019 - Artificial Intelligence 272 (C):101-142.
On the complexity of admissible search algorithms.Alberto Martelli - 1977 - Artificial Intelligence 8 (1):1-13.
Personnel Scheduling Problem under Hierarchical Management Based on Intelligent Algorithm.Li Huang, Chunming Ye, Jie Gao, Po-Chou Shih, Franley Mngumi & Xun Mei - 2021 - Complexity 2021:1-14.
Analytics
Added to PP
2020-12-22
Downloads
12 (#1,093,652)
6 months
5 (#836,811)
2020-12-22
Downloads
12 (#1,093,652)
6 months
5 (#836,811)
Historical graph of downloads
Citations of this work
Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity.Haris Aziz, Péter Biró, Ronald de Haan & Baharak Rastegari - 2019 - Artificial Intelligence 276 (C):57-78.
References found in this work
Distributed fair allocation of indivisible goods.Yann Chevaleyre, Ulle Endriss & Nicolas Maudet - 2017 - Artificial Intelligence 242 (C):1-22.
On the evaluation of election outcomes under uncertainty.Noam Hazon, Yonatan Aumann, Sarit Kraus & Michael Wooldridge - 2012 - Artificial Intelligence 189 (C):1-18.
Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity.Haris Aziz, Péter Biró, Ronald de Haan & Baharak Rastegari - 2019 - Artificial Intelligence 276 (C):57-78.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-5pqs9 uwo