Ankang Sun

Orcid: 0000-0003-1464-1979

According to our database1, Ankang Sun authored at least 15 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
On the Subsidy of Envy-Free Orientations in Graphs.
CoRR, February, 2025

Randomized strategyproof mechanisms with best of both worlds fairness and efficiency.
Eur. J. Oper. Res., 2025

Improved Approximation of Maximin Share Fair Allocation Under Generalized Assignment Constraints.
Proceedings of the Frontiers of Algorithmics - 19th International Joint Conference, 2025

The (Exact) Price of Cardinality for Indivisible Goods: A Parametric Perspective.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024
On Hill's Worst-Case Guarantee for Indivisible Bads.
ACM Trans. Economics and Comput., December, 2024

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
CoRR, 2024

Allocating Contiguous Blocks of Indivisible Chores Fairly: Revisited.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Bounding the Incentive Ratio of the Probabilistic Serial Rule.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Envy-Free House Allocation under Uncertain Preferences.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Fairness criteria for allocating indivisible chores: connections and efficiencies.
Auton. Agents Multi Agent Syst., October, 2023

Equitability and welfare maximization for allocating indivisible items.
Auton. Agents Multi Agent Syst., 2023

On the Price of Fairness in the Connected Discrete Cake Cutting Problem.
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.
CoRR, 2022

2021
Approximate Group Fairness for Clustering.
Proceedings of the 38th International Conference on Machine Learning, 2021

Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021


  Loading...