- 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
Towards optimal subsidy bounds for envy-freeable allocations
Artificial Intelligence 348 (C):104406 (2025)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Envy-free allocations respecting social networks.Robert Bredereck, Andrzej Kaczmarczyk & Rolf Niedermeier - 2022 - Artificial Intelligence 305 (C):103664.
Optimal query complexity bounds for finding graphs.Sung-Soon Choi & Jeong Han Kim - 2010 - Artificial Intelligence 174 (9-10):551-569.
How do fairness definitions fare? Testing public attitudes towards three algorithmic definitions of fairness in loan allocations.Nripsuta Ani Saxena, Karen Huang, Evan DeFilippis, Goran Radanovic, David C. Parkes & Yang Liu - 2020 - Artificial Intelligence 283 (C):103238.
Local envy-freeness and equal-income Walrasian allocations.Susumu Cato - 2010 - Economics Letters 107 (2):239–241.
Approximately EFX allocations for indivisible chores.Shengwei Zhou & Xiaowei Wu - 2024 - Artificial Intelligence 326 (C):104037.
Weighted EF1 allocations for indivisible chores.Xiaowei Wu, Cong Zhang & Shengwei Zhou - 2025 - Artificial Intelligence 347 (C):104386.
Local strict envy-freeness in large economies.Susumu Cato - 2010 - Mathematical Social Sciences 59 (3):319–322.
Almost proportional allocations of indivisible chores: Computation, approximation and efficiency.Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu & Xinran Zhu - 2024 - Artificial Intelligence 331 (C):104118.
The complexity of envy-free graph cutting.Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm & Sebastian Ordyniak - 2026 - Artificial Intelligence 358 (C):104585.
Fair allocations in large economies with unequal production skills.Susumu Cato - 2012 - International Journal of Economic Theory 8 (4):321–336.
Analytics
Added to PP
2025-08-31
Downloads
22 (#1,786,943)
6 months
12 (#963,916)
2025-08-31
Downloads
22 (#1,786,943)
6 months
12 (#963,916)
Historical graph of downloads
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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