activity
20082026
most citedCombinatorial Multi-Armed Bandit with General Reward Functions

75 citations · 395 across the 56 of their papers we have counts for

collaborators

62 papers

cs.GT2026

Auctions with Contract Design

Xiaolin Bu, Jiarong Jin, Junzhu Ke +6

We consider a new auction model where the bidders' utilities and the auctioneer's revenue depend on a quality factor of the transaction determined by costly and strategic investmen…

cs.AI2023★ 2 cited

A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem

Zhang-Hua Fu, Sipeng Sun, Jintong Ren +6

For prohibitively large-scale Travelling Salesman Problems (TSPs), existing algorithms face big challenges in terms of both computational efficiency and solution quality. To addres…

cs.GT2023★ 2 cited

Auction Design for Value Maximizers with Budget and Return-on-spend Constraints

Pinyan Lu, Chenyang Xu, Ruilong Zhang

The paper designs revenue-maximizing auction mechanisms for agents who aim to maximize their total obtained values rather than the classical quasi-linear utilities. Several models…

cs.DS2023

Improved Coresets for Clustering with Capacity and Fairness Constraints

Lingxiao Huang, Pinyan Lu, Xuan Wu

We study coresets for clustering with capacity and fairness constraints. Our main result is a near-linear time algorithm to construct -sized $\va…

cs.GT2022

Bidder Subset Selection Problem in Auction Design

Xiaohui Bei, Nick Gravin, Pinyan Lu +1

Motivated by practical concerns in the online advertising industry, we study a bidder subset selection problem in single-item auctions. In this problem, a large pool of candidate b…

cs.GT2022

Better Approximation for Interdependent SOS Valuations

Pinyan Lu, Enze Sun, Chenghan Zhou

Submodular over signal (SOS) defines a family of interesting functions for which there exist truthful mechanisms with constant approximation to the social welfare for agents with i…