default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnkang Sun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Haris Aziz, Isaiah Iliffe, Bo Li, Angus Ritossa, Ankang Sun, Mashbat Suzuki:
Envy-Free House Allocation under Uncertain Preferences. AAAI 2024: 9477-9484- [c6]Bo Li, Ankang Sun, Shiji Xing:
Bounding the Incentive Ratio of the Probabilistic Serial Rule. AAMAS 2024: 1128-1136 - [c5]Ankang Sun, Bo Li:
Allocating Contiguous Blocks of Indivisible Chores Fairly: Revisited. AAMAS 2024: 1800-1808 - [i7]Ankang Sun, Bo Chen:
Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency. CoRR abs/2408.01027 (2024) - [i6]Bo Li, Ankang Sun, Shiji Xing:
A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It? CoRR abs/2410.15738 (2024) - 2023
- [j2]Ankang Sun
, Bo Chen, Xuan Vinh Doan:
Equitability and welfare maximization for allocating indivisible items. Auton. Agents Multi Agent Syst. 37(1): 8 (2023) - [j1]Ankang Sun, Bo Chen, Xuan Vinh Doan:
Fairness criteria for allocating indivisible chores: connections and efficiencies. Auton. Agents Multi Agent Syst. 37(2): 39 (2023) - [c4]Ankang Sun, Bo Chen, Xuan Vinh Doan:
Equitability and Welfare Maximization for Allocating Indivisible Items. AAMAS 2023: 561-563 - [c3]Ankang Sun, Bo Li:
On the Price of Fairness in the Connected Discrete Cake Cutting Problem. ECAI 2023: 2242-2249 - [i5]Bo Li, Hervé Moulin, Ankang Sun, Yu Zhou:
On Hill's Worst-Case Guarantee for Indivisible Bads. CoRR abs/2302.00323 (2023) - [i4]Haris Aziz, Isaiah Iliffe, Bo Li, Angus Ritossa, Ankang Sun, Mashbat Suzuki:
Envy-free House Allocation under Uncertain Preferences. CoRR abs/2312.11286 (2023) - 2022
- [i3]Bo Li, Lijun Li, Ankang Sun, Chenhao Wang, Yingfan Wang:
Approximate Group Fairness for Clustering. CoRR abs/2203.17146 (2022) - [i2]Ankang Sun, Bo Li:
On the Price of Fairness of Allocating Contiguous Blocks. CoRR abs/2205.10836 (2022) - 2021
- [c2]Ankang Sun, Bo Chen, Xuan Vinh Doan:
Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores. AAMAS 2021: 1281-1289 - [c1]Bo Li, Lijun Li, Ankang Sun, Chenhao Wang, Yingfan Wang:
Approximate Group Fairness for Clustering. ICML 2021: 6381-6391 - [i1]Ankang Sun, Bo Chen, Xuan Vinh Doan:
Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores. CoRR abs/2101.07435 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
