default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXinhang Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Shengxin Liu, Xinhang Lu, Mashbat Suzuki, Toby Walsh:
Mixed Fair Division: A Survey. J. Artif. Intell. Res. 80: 1373-1406 (2024)- [j7]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-based voting with mixed goods. Soc. Choice Welf. 62(4): 643-677 (2024) - [j6]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Correction: Approval-based voting with mixed goods. Soc. Choice Welf. 62(4): 679 (2024) - [c11]Haris Aziz, Xinhang Lu, Mashbat Suzuki, Jeremy Vollen, Toby Walsh:
Fair Lotteries for Participatory Budgeting. AAAI 2024: 9469-9476 - [c10]Shengxin Liu, Xinhang Lu, Mashbat Suzuki, Toby Walsh:
Mixed Fair Division: A Survey. AAAI 2024: 22641-22649 - [c9]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao, Yichen Tao:
A Complete Landscape for the Price of Envy-Freeness. AAMAS 2024: 1183-1191 - [c8]Xiaohui Bei, Alexander Lam, Xinhang Lu, Warut Suksompong:
Welfare Loss in Connected Resource Allocation. IJCAI 2024: 2660-2668 - [i13]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao, Yichen Tao:
A Complete Landscape for the Price of Envy-Freeness. CoRR abs/2401.01516 (2024) - [i12]Haris Aziz, Xinhang Lu, Mashbat Suzuki, Jeremy Vollen, Toby Walsh:
Fair Lotteries for Participatory Budgeting. CoRR abs/2404.05198 (2024) - [i11]Xiaohui Bei, Alexander Lam, Xinhang Lu, Warut Suksompong:
Welfare Loss in Connected Resource Allocation. CoRR abs/2405.03467 (2024) - 2023
- [c7]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-Based Voting with Mixed Goods. AAAI 2023: 5781-5788 - [c6]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao:
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. IJCAI 2023: 2808-2816 - [i10]Haris Aziz, Xinhang Lu, Mashbat Suzuki, Jeremy Vollen, Toby Walsh:
Best-of-Both-Worlds Fairness in Committee Voting. CoRR abs/2303.03642 (2023) - [i9]Zihao Li
, Shengxin Liu, Xinhang Lu, Biaoshuai Tao:
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. CoRR abs/2305.09206 (2023) - [i8]Shengxin Liu, Xinhang Lu, Mashbat Suzuki, Toby Walsh:
Mixed Fair Division: A Survey. CoRR abs/2306.09564 (2023) - [i7]Xiaohui Bei, Shengxin Liu, Xinhang Lu:
Fair Division with Subjective Divisibility. CoRR abs/2310.00976 (2023) - 2022
- [j5]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. SIAM J. Discret. Math. 36(2): 1156-1186 (2022) - [j4]Chenchen Fu, Xinhang Lu, Xiaoxing Qiu, Sujunjie Sun, Xueyong Xu, Weiwei Wu, Chun Jason Xue, Song Han:
Throughput Maximization in Wireless Communication Systems Powered by Hybrid Energy Harvesting. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(11): 3981-3992 (2022) - [c5]Xiaohui Bei, Xinhang Lu, Warut Suksompong:
Truthful Cake Sharing. AAAI 2022: 4809-4817 - [i6]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-Based Voting with Mixed Goods. CoRR abs/2211.12647 (2022) - 2021
- [j3]Xiaohui Bei, Shengxin Liu, Xinhang Lu, Hongao Wang:
Maximin fairness with mixed divisible and indivisible goods. Auton. Agents Multi Agent Syst. 35(2): 34 (2021) - [j2]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair division of mixed divisible and indivisible goods. Artif. Intell. 293: 103436 (2021) - [j1]Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. Theory Comput. Syst. 65(7): 1069-1093 (2021) - [c4]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. AAAI 2021: 5151-5158 - [c3]Xiaohui Bei, Shengxin Liu, Xinhang Lu, Hongao Wang:
Maximin Fairness with Mixed Divisible and Indivisible Goods. AAAI 2021: 5167-5175 - [i5]Xiaohui Bei, Xinhang Lu, Warut Suksompong:
Truthful Cake Sharing. CoRR abs/2112.05632 (2021) - 2020
- [c2]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair Division of Mixed Divisible and Indivisible Goods. AAAI 2020: 1814-1821 - [i4]Xiaohui Bei, Shengxin Liu, Xinhang Lu, Hongao Wang:
Maximin Fairness with Mixed Divisible and Indivisible Goods. CoRR abs/2002.05245 (2020)
2010 – 2019
- 2019
- [c1]Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. IJCAI 2019: 81-87 - [i3]Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. CoRR abs/1905.04910 (2019) - [i2]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
Connected Fair Allocation of Indivisible Goods. CoRR abs/1908.05433 (2019) - [i1]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair Division of Mixed Divisible and Indivisible Goods. CoRR abs/1911.07048 (2019)
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 2024-10-21 20:31 CEST 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:
