activity
20152021
most citedA Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model

4 citations · 6 across the 9 of their papers we have counts for

collaborators
Showing cs.GTShow all

9 papers · 1 filter

cs.GT2021

Approximately Efficient Bilateral Trade

Yuan Deng, Jieming Mao, Balasubramanian Sivan +1

We study bilateral trade between two strategic agents. The celebrated result of Myerson and Satterthwaite states that in general, no incentive-compatible, individually rational and…

cs.GT20211 cited

Robust Auction Design in the Auto-bidding World

Santiago Balseiro, Yuan Deng, Jieming Mao +2

In classic auction theory, reserve prices are known to be effective for improving revenue for the auctioneer against quasi-linear utility maximizing bidders. The introduction of re…

cs.GT2021

Interactive Communication in Bilateral Trade

Jieming Mao, Renato Paes Leme, Kangning Wang

We define a model of interactive communication where two agents with private types can exchange information before a game is played. The model contains Bayesian persuasion as a spe…

cs.GT2021

Towards Efficient Auctions in an Auto-bidding World

Yuan Deng, Jieming Mao, Vahab Mirrokni +1

Auto-bidding has become one of the main options for bidding in online advertisements, in which advertisers only need to specify high-level objectives and leave the complex task of…

cs.GT2019

Diversity and Exploration in Social Learning

Nicole Immorlica, Jieming Mao, Christos Tzamos

In consumer search, there is a set of items. An agent has a prior over her value for each item and can pay a cost to learn the instantiation of her value. After exploring a subset…

cs.GT20191 cited

Bayesian Exploration with Heterogeneous Agents

Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins +1

It is common in recommendation systems that users both consume and produce information as they make strategic choices under uncertainty. While a social planner would balance "explo…