English | 繁體

Search in the results

UM

Browse/Search Results:  1-3 of 3 Help

Selected(0)Clear Items/Page:    Sort:
Almost proportional allocations of indivisible chores: Computation, approximation and efficiency Journal article
Aziz, Haris, Li, Bo, Moulin, Hervé, Wu, Xiaowei, Zhu, Xinran. Almost proportional allocations of indivisible chores: Computation, approximation and efficiency[J]. Artificial Intelligence, 2024, 331, 104118.
Authors:  Aziz, Haris;  Li, Bo;  Moulin, Hervé;  Wu, Xiaowei;  Zhu, Xinran
Favorite | TC[WOS]:1 TC[Scopus]:1  IF:5.1/4.8 | Submit date：2024/05/16
Indivisible Chores  Ordinal Preferences  Pareto Optimal  Propx  
Fair division of indivisible goods: Recent progress and open questions Journal article
Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, Xiaowei Wu. Fair division of indivisible goods: Recent progress and open questions[J]. Artificial Intelligence, 2023, 322, 103965.
Authors:  Georgios Amanatidis;  Haris Aziz;  Georgios Birmpas;  Aris Filos-Ratsikas;  Bo Li; et al.
Favorite | TC[WOS]:25 TC[Scopus]:37  IF:5.1/4.8 | Submit date：2023/07/28
Discrete Fair Division  Envy-freeness  Proportionality  Ef1  Efx  Mms  
Approximate and strategyproof maximin share allocation of chores with ordinal preferences Journal article
Aziz Haris, Li Bo, Wu Xiaowei. Approximate and strategyproof maximin share allocation of chores with ordinal preferences[J]. MATHEMATICAL PROGRAMMING, 2022, 203(1-2), 319-345.
Authors:  Aziz Haris;  Li Bo;  Wu Xiaowei
Favorite | TC[WOS]:4 TC[Scopus]:1  IF:2.2/3.3 | Submit date：2022/07/18
Fair Allocation  Maximin Share  Chores  Ordinal Preferences  Strategyproofness