![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Zihao Li 0002
Person information
- affiliation: Nanyang Technological University (NTU), School of Physical and Mathematical Sciences, Singapore
Other persons with the same name
- Zihao Li — disambiguation page
- Zihao Li 0001
— Hong Kong Polytechnic University, Hong Kong
- Zihao Li 0003
— University of Glasgow, School of Law, Glasgow, UK (and 1 more)
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c7]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Prioritized Agents. AAAI 2023: 5540-5548 - [c6]Zihao Li
, Hao Wang, Zhenzhen Yan:
Fully Online Matching with Stochastic Arrivals and Departures. AAAI 2023: 12014-12021 - [c5]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao:
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. IJCAI 2023: 2808-2816 - [c4]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Allocator's Preference. WINE 2023: 77-94 - [i7]Zihao Li, Hao Wang, Zhenzhen Yan:
Sample-Based Online Generalized Assignment Problem with Unknown Poisson Arrivals. CoRR abs/2302.08234 (2023) - [i6]Zihao Li
, Shengxin Liu, Xinhang Lu, Biaoshuai Tao:
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. CoRR abs/2305.09206 (2023) - [i5]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Allocator's Preference. CoRR abs/2310.03475 (2023) - 2022
- [c3]Zihao Li
, Xiaohui Bei, Zhenzhen Yan:
Proportional allocation of indivisible resources under ordinal and uncertain preferences. UAI 2022: 1148-1157 - [c2]Xiaohui Bei, Zihao Li
, Junjie Luo:
Fair and Efficient Multi-resource Allocation for Cloud Computing. WINE 2022: 169-186 - [i4]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods. CoRR abs/2205.14296 (2022) - [i3]Xiaohui Bei, Zihao Li, Junjie Luo:
Fair and Efficient Multi-Resource Allocation for Cloud Computing. CoRR abs/2210.05237 (2022) - [i2]Xiaolin Bu, Zihao Li
, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Prioritized Agents. CoRR abs/2211.16143 (2022) - 2021
- [j1]Xiaohui Bei
, Zihao Li
, Jinyan Liu
, Shengxin Liu
, Xinhang Lu
:
Fair division of mixed divisible and indivisible goods. Artif. Intell. 293: 103436 (2021) - 2020
- [c1]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair Division of Mixed Divisible and Indivisible Goods. AAAI 2020: 1814-1821
2010 – 2019
- 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
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-25 23:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint