2 citations · 3 across the 9 of their papers we have counts for
10 papers
Optimal Analysis of Greedy for Stochastic Online Euclidean Matching
Mingwei Yang, Sophie H. Yu
We study Greedy for online metric matching with servers and requests sampled independently and uniformly from . Servers are available initially, and Greedy irrevoc…
Incentive Analysis of Collusion in Fair Division
Haoqiang Huang, Biaoshuai Tao, Mingwei Yang +1
We study fair division problems with strategic agents capable of gaining advantages by manipulating their reported preferences. Although several impossibility results have revealed…
When is Truthfully Allocating Chores no Harder than Goods?
Bo Li, Biaoshuai Tao, Fangxiao Wang +3
We study the problem of fairly and efficiently allocating a set of items among strategic agents with additive valuations, where items are either all indivisible or all divisible. W…
Online Metric Matching: Beyond the Worst Case
Mingwei Yang, Sophie H. Yu
We study the online metric matching problem. There are servers and requests located in a metric space, where all servers are available upfront and requests arrive one at a…
The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation
Xiaohui Bei, Biaoshuai Tao, Jiajun Wu +1
We study the problem of allocating divisible resources among agents, hopefully in a fair and efficient manner. With the presence of strategic agents, additional incentive guara…
Fair and Almost Truthful Mechanisms for Additive Valuations and Beyond
Biaoshuai Tao, Mingwei Yang
We study the problem of fairly allocating indivisible goods among strategic agents. It is well-known that truthfulness is incompatible with any meaningful fairness notions. We…
Contextual Decision-Making with Knapsacks Beyond the Worst Case
Zhaohua Chen, Rui Ai, Mingwei Yang +3
We study the framework of a dynamic decision-making scenario with resource constraints. In this framework, an agent, whose target is to maximize the total reward under the initial…
Fairly Allocating (Contiguous) Dynamic Indivisible Items with Few Adjustments
Mingwei Yang
We study the problem of dynamically allocating indivisible items to agents with the restriction that the allocation is fair all the time. Due to the negative results to ach…
Streaming Facility Location in High Dimension via Geometric Hashing
Artur Czumaj, Arnold Filtser, Shaofeng H. -C. Jiang +3
In Euclidean Uniform Facility Location (UFL), the input is a set of clients in and the goal is to place facilities to serve them, so as to minimize the total cost of…
Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties
Zhaohua Chen, Mingwei Yang, Chang Wang +5
In today's online advertising markets, it is common for advertisers to set long-term budgets. Correspondingly, advertising platforms adopt budget control methods to ensure that adv…