activity
20202026
most citedDynamic Budget Throttling in Repeated Second-Price Auctions

4 citations · 11 across the 13 of their papers we have counts for

collaborators

13 papers

cs.GT2026

Pareto-Efficient Multi-Buyer Mechanisms: Characterization, Fairness and Welfare

Moshe Babaioff, Sijin Chen, Zhaohua Chen +1

A truthful mechanism for a Bayesian single-item auction results with some ex-ante revenue for the seller, and some ex-ante total surplus for the buyers. We study the Pareto frontie…

cs.GT2026

Ad Insertion in LLM-Generated Responses

Shengwei Xu, Zhaohua Chen, Xiaotie Deng +2

Sustainable monetization of large language models (LLMs) remains a critical open challenge. Traditional search advertising, which relies on static keywords, fails to capture the fl…

cs.GT2024

Are Bounded Contracts Learnable and Approximately Optimal?

Yurong Chen, Zhaohua Chen, Xiaotie Deng +1

This paper considers the hidden-action model of the principal-agent problem, in which a principal incentivizes an agent to work on a project using a contract. We investigate whethe…

cs.GT2023

Robust Decision Aggregation with Second-order Information

Yuqi Pan, Zhaohua Chen, Yuqing Kong

We consider a decision aggregation problem with two experts who each make a binary recommendation after observing a private signal about an unknown binary world state. An agent, wh…

cs.GT2023★ 2 cited

Coordinated Dynamic Bidding in Repeated Second-Price Auctions with Budgets

Yurong Chen, Qian Wang, Zhijian Duan +4

In online ad markets, a rising number of advertisers are employing bidding agencies to participate in ad auctions. These agencies are specialized in designing online algorithms and…

cs.LG2022★ 1 cited

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…

cs.GT2022★ 4 cited

Dynamic Budget Throttling in Repeated Second-Price Auctions

Zhaohua Chen, Chang Wang, Qian Wang +6

In today's online advertising markets, a crucial requirement for an advertiser is to control her total expenditure within a time horizon under some budget. Among various budget con…

cs.GT2022★ 2 cited

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…

cs.CR2021

An Efficient and Robust Committee Structure for Sharding Blockchain

Mengqian Zhang, Jichen Li, Zhaohua Chen +2

Nowadays, sharding is deemed as a promising way to save traditional blockchain protocols from their low scalability. However, such technique also brings several potential risks and…

cs.GT2021★ 1 cited

On Tightness of Tsaknakis-Spirakis Descent Methods for Approximate Nash Equilibria

Zhaohua Chen, Xiaotie Deng, Wenhan Huang +2

This article explores the minimum approximation ratio for Nash equilibrium in bi-matrix games, focusing on the Tsaknakis and Spirakis (TS) methods. The previous SOTA, TS algorithm,…

cs.CR2020

Decentralized Asset Custody Scheme with Security against Rational Adversary

Zhaohua Chen, Guang Yang

Asset custody is a core financial service in which the custodian holds in-safekeeping assets on behalf of the client. Although traditional custody service is typically endorsed by…

cs.CR2020

An Efficient Permissioned Blockchain with Provable Reputation Mechanism

Hongyin Chen, Zhaohua Chen, Yukun Cheng +5

The design of permissioned blockchains places an access control requirement for members to read, access, and write information over the blockchains. In this paper, we study a hiera…

cs.DC2020★ 1 cited

CycLedger: A Scalable and Secure Parallel Protocol for Distributed Ledger via Sharding

Mengqian Zhang, Jichen Li, Zhaohua Chen +2

Traditional public distributed ledgers have not been able to scale-out well and work efficiently. Sharding is deemed as a promising way to solve this problem. By partitioning all n…