Xiaohui Bei

According to our database1, Xiaohui Bei authored at least 37 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Maximin Fairness with Mixed Divisible and Indivisible Goods.
CoRR, 2020

Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Earning and Utility Limits in Fisher Markets.
ACM Trans. Economics and Comput., 2019

Ascending-Price Algorithms for Unknown Markets.
ACM Trans. Algorithms, 2019

Fair Division of Mixed Divisible and Indivisible Goods.
CoRR, 2019

Dividing a Graphical Cake.
CoRR, 2019

Connected Fair Allocation of Indivisible Goods.
CoRR, 2019

From independent sets and vertex colorings to isotropic spaces and isotropic decompositions.
CoRR, 2019

Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Correlation-Robust Analysis of Single Item Auction.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Balancing Efficiency and Fairness in On-Demand Ridesourcing.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

The Price of Fairness for Indivisible Goods.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Optimal Trip-Vehicle Dispatch with Multi-Type Requests.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
An Efficient Auction with Variable Reserve Prices for Ridesourcing.
Proceedings of the PRICAI 2018: Trends in Artificial Intelligence, 2018

Truthful Fair Division without Free Disposal.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Efficient Auctions with Identity-Dependent Negative Externalities.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Algorithms for Trip-Vehicle Assignment in Ride-Sharing.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Worst-Case Mechanism Design via Bayesian Analysis.
SIAM J. Comput., 2017

Earning Limits in Fisher Markets with Spending-Constraint Utilities.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Online Roommate Allocation Problem.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Networked Fairness in Cake Cutting.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Cake Cutting: Envy and Truth.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Trial and Error Algorithms.
Encyclopedia of Algorithms, 2016

Computing Equilibria in Markets with Budget-Additive Utilities.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Learning Market Parameters Using Aggregate Demand Queries.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Tatonnement for Linear and Gross Substitutes Markets.
CoRR, 2015

Solving Linear Programming with Constraints Unknown.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2013
Trial and error in influential social networks.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012
On the Complexity of Trial and Error.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Distributed Consensus Resilient to Both Crash Failures and Strategic Manipulations
CoRR, 2012

Budget feasible mechanism design: from prior-free to bayesian.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Optimal Proportional Cake Cutting with Connected Pieces.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Bounded budget betweenness centrality game for strategic network formations.
Theor. Comput. Sci., 2011

Budget Feasible Mechanism Design via Random Sampling
CoRR, 2011

Bayesian Incentive Compatibility via Fractional Assignments.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Towards Optimal Bayesian Algorithmic Mechanism Design
CoRR, 2010


  Loading...