default search action
Xiaohui Bei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-based voting with mixed goods. Soc. Choice Welf. 62(4): 643-677 (2024) - [j12]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Correction: Approval-based voting with mixed goods. Soc. Choice Welf. 62(4): 679 (2024) - [c42]Xiaohui Bei, Alexander Lam, Xinhang Lu, Warut Suksompong:
Welfare Loss in Connected Resource Allocation. IJCAI 2024: 2660-2668 - [i28]Xiaohui Bei, Alexander Lam, Xinhang Lu, Warut Suksompong:
Welfare Loss in Connected Resource Allocation. CoRR abs/2405.03467 (2024) - 2023
- [c41]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-Based Voting with Mixed Goods. AAAI 2023: 5781-5788 - [c40]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Bidder Subset Selection Problem in Auction Design. SODA 2023: 3788-3801 - [c39]Hongtao Lv, Xiaohui Bei, Zhenzhe Zheng, Fan Wu:
Auction Design for Bidders with Ex Post ROI Constraints. WINE 2023: 492-508 - [i27]Xiaohui Bei, Biaoshuai Tao, Jiajun Wu, Mingwei Yang:
The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation. CoRR abs/2308.08903 (2023) - [i26]Xiaohui Bei, Shengxin Liu, Xinhang Lu:
Fair Division with Subjective Divisibility. CoRR abs/2310.00976 (2023) - [i25]Hongtao Lv, Xiaohui Bei, Zhenzhe Zheng, Fan Wu:
Auction Design for Bidders with Ex Post ROI Constraints. CoRR abs/2310.02064 (2023) - 2022
- [j11]Xiaohui Bei, Shengxin Liu
, Chung Keung Poon, Hongao Wang:
Candidate selections with proportional fairness constraints. Auton. Agents Multi Agent Syst. 36(1): 5 (2022) - [j10]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. SIAM J. Discret. Math. 36(2): 1156-1186 (2022) - [c38]Hao Wang, Xiaohui Bei:
Real-Time Driver-Request Assignment in Ridesourcing. AAAI 2022: 3840-3849 - [c37]Xiaohui Bei, Xinhang Lu, Warut Suksompong:
Truthful Cake Sharing. AAAI 2022: 4809-4817 - [c36]Xiaohui Bei, Shengyu Zhang:
The Secretary Problem with Competing Employers on Random Edge Arrivals. AAAI 2022: 4818-4825 - [c35]Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao, Zhiya Chen:
Heterogeneous Multi-commodity Network Flows over Time. CSR 2022: 238-255 - [c34]Zihao Li
Proportional allocation of indivisible resources under ordinal and uncertain preferences. UAI 2022: 1148-1157 - [c33]Xiaohui Bei, Zihao Li
Fair and Efficient Multi-resource Allocation for Cloud Computing. WINE 2022: 169-186 - [i24]Xiaohui Bei, Zihao Li, Junjie Luo:
Fair and Efficient Multi-Resource Allocation for Cloud Computing. CoRR abs/2210.05237 (2022) - [i23]Xiaohui Bei, Nick Gravin, Pinyan Lu
Bidder Subset Selection Problem in Auction Design. CoRR abs/2211.10969 (2022) - [i22]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-Based Voting with Mixed Goods. CoRR abs/2211.12647 (2022) - 2021
- [j9]Xiaohui Bei, Shengxin Liu
Maximin fairness with mixed divisible and indivisible goods. Auton. Agents Multi Agent Syst. 35(2): 34 (2021) - [j8]Xiaohui Bei
Fair division of mixed divisible and indivisible goods. Artif. Intell. 293: 103436 (2021) - [j7]Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. Theory Comput. Syst. 65(7): 1069-1093 (2021) - [j6]Xiaohui Bei, Shiteng Chen
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces. SIAM J. Comput. 50(3): 924-971 (2021) - [c32]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. AAAI 2021: 5151-5158 - [c31]Xiaohui Bei, Warut Suksompong:
Dividing a Graphical Cake. AAAI 2021: 5159-5166 - [c30]Xiaohui Bei, Shengxin Liu, Xinhang Lu, Hongao Wang:
Maximin Fairness with Mixed Divisible and Indivisible Goods. AAAI 2021: 5167-5175 - [c29]Chunxue Yang, Xiaohui Bei:
Learning Optimal Auctions with Correlated Valuations from Samples. ICML 2021: 11716-11726 - [c28]Sijun Tan, Jibang Wu, Xiaohui Bei, Haifeng Xu:
Least Square Calibration for Peer Reviews. NeurIPS 2021: 27069-27080 - [i21]Sijun Tan, Jibang Wu, Xiaohui Bei, Haifeng Xu:
Least Square Calibration for Peer Review. CoRR abs/2110.12607 (2021) - [i20]Xiaohui Bei, Xinhang Lu, Warut Suksompong:
Truthful Cake Sharing. CoRR abs/2112.05632 (2021) - 2020
- [j5]Xiaohui Bei, Guangda Huzhang, Warut Suksompong:
Truthful fair division without free disposal. Soc. Choice Welf. 55(3): 523-545 (2020) - [c27]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair Division of Mixed Divisible and Indivisible Goods. AAAI 2020: 1814-1821 - [c26]Xiaohui Bei, Shengxin Liu, Chung Keung Poon, Hongao Wang:
Candidate Selections with Proportional Fairness Constraints. AAMAS 2020: 150-158 - [c25]Xiaohui Bei
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces. ITCS 2020: 8:1-8:48 - [c24]Xiaohui Bei
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. SODA 2020: 2114-2123 - [i19]Xiaohui Bei, Shengxin Liu, Xinhang Lu, Hongao Wang:
Maximin Fairness with Mixed Divisible and Indivisible Goods. CoRR abs/2002.05245 (2020)
2010 – 2019
- 2019
- [j4]Xiaohui Bei
Ascending-Price Algorithms for Unknown Markets. ACM Trans. Algorithms 15(3): 37:1-37:33 (2019) - [j3]Xiaohui Bei
Earning and Utility Limits in Fisher Markets. ACM Trans. Economics and Comput. 7(2): 10:1-10:35 (2019) - [c23]Taoan Huang, Bohui Fang, Hoon Oh, Xiaohui Bei
Optimal Trip-Vehicle Dispatch with Multi-Type Requests. AAMAS 2019: 2024-2026 - [c22]Xiaohui Bei
The Price of Fairness for Indivisible Goods. IJCAI 2019: 81-87 - [c21]Nixie S. Lesmana, Xuan Zhang, Xiaohui Bei
Balancing Efficiency and Fairness in On-Demand Ridesourcing. NeurIPS 2019: 5310-5320 - [c20]Xiaohui Bei
Correlation-Robust Analysis of Single Item Auction. SODA 2019: 193-208 - [c19]Taoan Huang, Bohui Fang, Xiaohui Bei
Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests. UAI 2019: 250-260 - [i18]Xiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, Xiaoming Sun:
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions. CoRR abs/1904.03950 (2019) - [i17]Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. CoRR abs/1905.04910 (2019) - [i16]Xiaohui Bei, Xiaoming Sun, Hao Wu, Jialin Zhang, Zhijie Zhang, Wei Zi:
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. CoRR abs/1907.05083 (2019) - [i15]Taoan Huang, Bohui Fang, Xiaohui Bei, Fei Fang:
Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests. CoRR abs/1907.08739 (2019) - [i14]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
Connected Fair Allocation of Indivisible Goods. CoRR abs/1908.05433 (2019) - [i13]Xiaohui Bei, Warut Suksompong:
Dividing a Graphical Cake. CoRR abs/1910.14129 (2019) - [i12]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair Division of Mixed Divisible and Indivisible Goods. CoRR abs/1911.07048 (2019) - 2018
- [c18]Xiaohui Bei
Algorithms for Trip-Vehicle Assignment in Ride-Sharing. AAAI 2018: 3-9 - [c17]Chaoli Zhang, Xiang Wang, Fan Wu, Xiaohui Bei
Efficient Auctions with Identity-Dependent Negative Externalities. AAMAS 2018: 2156-2158 - [c16]Xiaohui Bei
Truthful Fair Division without Free Disposal. IJCAI 2018: 63-69 - [c15]Chaoli Zhang, Fan Wu, Xiaohui Bei
An Efficient Auction with Variable Reserve Prices for Ridesourcing. PRICAI (1) 2018: 361-374 - [i11]Xiaohui Bei, Guangda Huzhang, Warut Suksompong:
Truthful Fair Division without Free Disposal. CoRR abs/1804.06923 (2018) - 2017
- [j2]Xiaohui Bei
Worst-Case Mechanism Design via Bayesian Analysis. SIAM J. Comput. 46(4): 1428-1448 (2017) - [c14]Guangda Huzhang, Xin Huang, Shengyu Zhang, Xiaohui Bei
Online Roommate Allocation Problem. IJCAI 2017: 235-241 - [c13]Xiaohui Bei
Cake Cutting: Envy and Truth. IJCAI 2017: 3625-3631 - [c12]Xiaohui Bei
Networked Fairness in Cake Cutting. IJCAI 2017: 3632-3638 - [c11]Xiaohui Bei
Earning Limits in Fisher Markets with Spending-Constraint Utilities. SAGT 2017: 67-79 - [i10]Xiaohui Bei, Youming Qiao, Shengyu Zhang:
Networked Fairness in Cake Cutting. CoRR abs/1707.02033 (2017) - 2016
- [c10]Xiaohui Bei
Learning Market Parameters Using Aggregate Demand Queries. AAAI 2016: 411-417 - [c9]Xiaohui Bei
Computing Equilibria in Markets with Budget-Additive Utilities. ESA 2016: 8:1-8:14 - [c8]Xiaohui Bei
Ascending-Price Algorithms for Unknown Markets. EC 2016: 699 - [r1]Xiaohui Bei, Ning Chen, Shengyu Zhang:
Trial and Error Algorithms. Encyclopedia of Algorithms 2016: 2258-2261 - [i9]Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn:
Computing Equilibria in Markets with Budget-Additive Utilities. CoRR abs/1603.07210 (2016) - 2015
- [c7]Xiaohui Bei
Solving Linear Programming with Constraints Unknown. ICALP (1) 2015: 129-142 - [i8]Xiaohui Bei, Jugal Garg, Martin Hoefer:
Tatonnement for Linear and Gross Substitutes Markets. CoRR abs/1507.04925 (2015) - 2013
- [c6]Xiaohui Bei
Trial and error in influential social networks. KDD 2013: 1016-1024 - [c5]Xiaohui Bei
On the complexity of trial and error. STOC 2013: 31-40 - [i7]Xiaohui Bei, Ning Chen, Shengyu Zhang:
Solving Linear Programming with Constraints Unknown. CoRR abs/1304.1247 (2013) - 2012
- [c4]Xiaohui Bei
Optimal Proportional Cake Cutting with Connected Pieces. AAAI 2012: 1263-1269 - [c3]Xiaohui Bei
Budget feasible mechanism design: from prior-free to bayesian. STOC 2012: 449-458 - [i6]Xiaohui Bei, Wei Chen, Jialin Zhang:
Distributed Consensus Resilient to Both Crash Failures and Strategic Manipulations. CoRR abs/1203.4324 (2012) - [i5]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget Feasible Mechanism Design: From Prior-Free to Bayesian. CoRR abs/1203.4455 (2012) - [i4]Xiaohui Bei, Ning Chen, Shengyu Zhang:
On the Complexity of Trial and Error. CoRR abs/1205.1183 (2012) - [i3]Xiaohui Bei
On the Complexity of Trial and Error. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j1]Xiaohui Bei
Bounded budget betweenness centrality game for strategic network formations. Theor. Comput. Sci. 412(52): 7147-7168 (2011) - [c2]Xiaohui Bei
Bayesian Incentive Compatibility via Fractional Assignments. SODA 2011: 720-733 - [i2]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget Feasible Mechanism Design via Random Sampling. CoRR abs/1107.2994 (2011) - 2010
- [i1]Xiaohui Bei, Zhiyi Huang:
Towards Optimal Bayesian Algorithmic Mechanism Design. CoRR abs/1005.4244 (2010)
2000 – 2009
- 2009
- [c1]Xiaohui Bei
Bounded Budget Betweenness Centrality Game for Strategic Network Formations. ESA 2009: 227-238
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-12-12 21:01 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: