Ankang Sun

Shiji Xing

CoRR, 2024

Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency.

[BibT_eX]

[DOI]

CoRR, 2024

Allocating Contiguous Blocks of Indivisible Chores Fairly: Revisited.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Bounding the Incentive Ratio of the Probabilistic Serial Rule.

[BibT_eX]

[DOI]

Shiji Xing

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Envy-Free House Allocation under Uncertain Preferences.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Fairness criteria for allocating indivisible chores: connections and efficiencies.

[BibT_eX]

[DOI]

Xuan Vinh Doan

Auton. Agents Multi Agent Syst., October, 2023

On Hill's Worst-Case Guarantee for Indivisible Bads.

[BibT_eX]

[DOI]

CoRR, 2023

Equitability and welfare maximization for allocating indivisible items.

[BibT_eX]

[DOI]

Xuan Vinh Doan

Auton. Agents Multi Agent Syst., 2023

On the Price of Fairness in the Connected Discrete Cake Cutting Problem.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

On the Price of Fairness of Allocating Contiguous Blocks.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Approximate Group Fairness for Clustering.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores.

[BibT_eX]

[DOI]