Nonstationary dual averaging and online fair allocation

L Liao, Y Gao, C Kroer - Advances in Neural Information …, 2022 - proceedings.neurips.cc
We consider the problem of fairly allocating sequentially arriving items to a set of individuals.
For this problem, the recently-introduced PACE algorithm leverages the dual averaging …

Bootstrapping Fisher Market Equilibrium and First-Price Pacing Equilibrium

L Liao, C Kroer - Forty-first International Conference on Machine …, 2024 - openreview.net
Linear Fisher market (LFM) is an equilibrium model for fair and efficient resource allocation,
and first-price pacing equilibrium (FPPE) is a model for budget-management in first-price …

On the convex formulations of robust Markov decision processes

J Grand-Clément, M Petrik - Mathematics of Operations …, 2024 - pubsonline.informs.org
Robust Markov decision processes (MDPs) are used for applications of dynamic
optimization in uncertain environments and have been studied extensively. Many of the …

Statistical inference and A/B testing for first-price pacing equilibria

L Liao, C Kroer - International Conference on Machine …, 2023 - proceedings.mlr.press
We initiate the study of statistical inference and A/B testing for first-price pacing equilibria
(FPPE). The FPPE model captures the dynamics resulting from large-scale first-price auction …

Online market equilibrium with application to fair division

Y Gao, A Peysakhovich, C Kroer - Advances in Neural …, 2021 - proceedings.neurips.cc
Computing market equilibria is a problem of both theoretical and applied interest. Much
research to date focuses on the case of static Fisher markets with full information on buyers' …

Statistical inference for fisher market equilibrium

L Liao, Y Gao, C Kroer - arXiv preprint arXiv:2209.15422, 2022 - arxiv.org
Statistical inference under market equilibrium effects has attracted increasing attention
recently. In this paper we focus on the specific case of linear Fisher markets. They have …

Online Fair Allocation with Best-of-Many-Worlds Guarantees

Z Yang, L Liao, Y Gao, C Kroer - arXiv preprint arXiv:2408.02403, 2024 - arxiv.org
We investigate the online fair allocation problem with sequentially arriving items under
various input models, with the goal of balancing fairness and efficiency. We propose the …

Markovian search with socially aware constraints

MR Aminian, V Manshadi, R Niazadeh - arXiv preprint arXiv:2501.13346, 2025 - arxiv.org
We study a general class of sequential search problems for selecting multiple candidates
from different societal groups under" ex-ante constraints" aimed at producing socially …

Design and selection of government regulations for vehicle supply chains: A Chinese perspective

L Liu, Z Wang, C Zhang - Computers & Industrial Engineering, 2024 - Elsevier
New energy vehicles (NEV) have become a major trajectory changer for the global auto
industry and an important catalyst for global sustainable economic growth. The …

Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees

Z Yang, L Liao, C Kroer - Proceedings of the AAAI Conference on …, 2024 - ojs.aaai.org
We study an online allocation problem with sequentially arriving items and adversarially
chosen agent values, with the goal of balancing fairness and efficiency. Our goal is to study …