Xiaohui Bei | DeepAI

AI Chat

Featured Co-authors

Hao Wu
145 publications
Haris Aziz
61 publications
Pasin Manurangsi
58 publications
Fei Fang
57 publications
Warut Suksompong
55 publications
Shengyu Zhang
48 publications
Haifeng Xu
44 publications
Xiaoming Sun
32 publications
Zihao Li
31 publications
Pinyan Lu
30 publications
Jialin Zhang
29 publications

∙ 11/23/2022

Approval-Based Voting with Mixed Goods

We consider a voting scenario in which the resource to be voted upon may...

0 Xinhang Lu, et al. ∙

∙ 11/20/2022

Bidder Subset Selection Problem in Auction Design

Motivated by practical concerns in the online advertising industry, we s...

0 Xiaohui Bei, et al. ∙

∙ 10/11/2022

Fair and Efficient Multi-Resource Allocation for Cloud Computing

We study the problem of allocating multiple types of resources to agents...

0 Xiaohui Bei, et al. ∙

∙ 12/10/2021

Truthful Cake Sharing

The classic cake cutting problem concerns the fair allocation of a heter...

0 Xiaohui Bei, et al. ∙

∙ 10/25/2021

Least Square Calibration for Peer Review

Peer review systems such as conference paper review often suffer from th...

0 Sijun Tan, et al. ∙

∙ 02/12/2020

Maximin Fairness with Mixed Divisible and Indivisible Goods

We study fair resource allocation when the resources contain a mixture o...

0 Xiaohui Bei, et al. ∙

∙ 11/16/2019

Fair Division of Mixed Divisible and Indivisible Goods

We study the problem of fair division when the resources contain both di...

1 Xiaohui Bei, et al. ∙

∙ 10/30/2019

Dividing a Graphical Cake

We consider the classical cake-cutting problem where we wish to fairly d...

0 Xiaohui Bei, et al. ∙

∙ 08/15/2019

Connected Fair Allocation of Indivisible Goods

We study the fair allocation of indivisible goods under the assumption t...

0 Xiaohui Bei, et al. ∙

∙ 07/20/2019

Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests

Transportation service providers that dispatch drivers and vehicles to r...

0 Taoan Huang, et al. ∙

∙ 07/11/2019

Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

The classical cake cutting problem studies how to find fair allocations ...

0 Xiaohui Bei, et al. ∙

∙ 05/13/2019

The Price of Fairness for Indivisible Goods

We investigate the efficiency of fair allocations of indivisible goods u...

0 Xiaohui Bei, et al. ∙

∙ 04/08/2019

From independent sets and vertex colorings to isotropic spaces and isotropic decompositions

In the 1970's, Lovász built a bridge between graphs and alternating matr...

0 Xiaohui Bei, et al. ∙

∙ 04/18/2018

Truthful Fair Division without Free Disposal

We study the problem of fairly dividing a heterogeneous resource, common...

0 Xiaohui Bei, et al. ∙

∙ 07/07/2017

Networked Fairness in Cake Cutting

We introduce a graphical framework for fair division in cake cutting, wh...

0 Xiaohui Bei, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world