Pan Xu

Orcid: 0000-0002-6362-6727

Affiliations:
  • New Jersey Institute of Technology (NJIT), Department of Computer Science, Newark, NJ, USA
  • University of Maryland, Department of Computer Science, College Park, MD, USA (PhD 2019)
  • Iowa State University, Department of Industrial & Manufacturing Systems Engineering, Ames, IA, USA (PhD 2012)


According to our database1, Pan Xu authored at least 48 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals.
ACM Trans. Economics and Comput., June, 2024

Exploring the Tradeoff Between System Profit and Income Equality Among Ride-hailing Drivers.
J. Artif. Intell. Res., 2024

Tight Competitive and Variance Analyses of Matching Policies in Gig Platforms.
Proceedings of the ACM on Web Conference 2024, 2024

Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Parameter-Dependent Competitive Analysis for Online Capacitated Coverage Maximization through Boostings and Attenuations.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Two-Sided Capacitated Submodular Maximization in Gig Platforms.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Allocation Problem in Remote Teleoperation: Online Matching with Offline Reusable Resources and Delayed Assignments.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Equity Promotion in Public Transportation.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Fairness Maximization among Offline Agents in Online-Matching Markets.
ACM Trans. Economics and Comput., December, 2022

Online minimum matching with uniform metric and random arrivals.
Oper. Res. Lett., 2022

Exploring the Tradeoff Between Competitive Ratio and Variance in Online-Matching Markets.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

The Generalized Magician Problem under Unknown Distributions and Related Applications.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Group-level Fairness Maximization in Online Bipartite Matching.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Equity Promotion in Online Resource Allocation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources.
ACM Trans. Economics and Comput., 2021

2020
Algorithms to Approximate Column-sparse Packing Problems.
ACM Trans. Algorithms, 2020

Trading the System Efficiency for the Income Equality of Drivers in Rideshare.
CoRR, 2020

Group-level Fairness Maximization in Online Bipartite Matching.
CoRR, 2020

Improved Approximation Algorithms for Stochastic-Matching Problems.
CoRR, 2020

Online Stochastic Matching: New Algorithms and Bounds.
Algorithmica, 2020

Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts.
Algorithmica, 2020

Trade the System Efficiency for the Income Equality of Drivers in Rideshare.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A Unified Model for the Two-stage Offline-then-Online Resource Allocation.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Matching Algorithm Design in E-Commerce: Harnessing the Power of Machine Learning via Stochastic Optimization.
PhD thesis, 2019

Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare.
CoRR, 2019

Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Interaction-Aware Arrangement for Event-Based Social Networks.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Online Resource Allocation with Matching Constraints.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

A Unified Approach to Online Matching with Conflict-Aware Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Improved Bounds in Stochastic Matching and Optimization.
Algorithmica, 2018

Onion Curve: A Space Filling Curve with Near-Optimal Clustering.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

A PTAS for a Class of Stochastic Dynamic Programs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Enumeration of Maximal Cliques from an Uncertain Graph.
IEEE Trans. Knowl. Data Eng., 2017

The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem.
SIAM J. Optim., 2017

Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Mining maximal cliques from an uncertain graph.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

2014
Optimality of Clustering Properties of Space-Filling Curves.
ACM Trans. Database Syst., 2014

An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions.
Comput. Oper. Res., 2014

2012
A Lower Bound on Proximity Preservation by Space Filling Curves.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

2011
An optimization approach to gene stacking.
Eur. J. Oper. Res., 2011


  Loading...