6 citations · 7 across the 3 of their papers we have counts for
4 papers
Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests
Taoan Huang, Bohui Fang, Xiaohui Bei +1
Transportation service providers that dispatch drivers and vehicles to riders start to support both on-demand ride requests posted in real time and rides scheduled in advance, lead…
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
Xiaohui Bei, Xiaoming Sun, Hao Wu +3
The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness c…
Networked Fairness in Cake Cutting
Xiaohui Bei, Youming Qiao, Shengyu Zhang
We introduce a graphical framework for fair division in cake cutting, where comparisons between agents are limited by an underlying network structure. We generalize the classical f…
Computing Equilibria in Markets with Budget-Additive Utilities
Xiaohui Bei, Jugal Garg, Martin Hoefer +1
We present the first analysis of Fisher markets with buyers that have budget-additive utility functions. Budget-additive utilities are elementary concave functions with numerous ap…