English
Related papers

Related papers: How to manipulate truthful prior-dependent mechani…

200 papers

Classical optimal auction theory assumes that bids reach the seller directly. We study how this picture changes when a revenue-maximizing intermediary controls access to the seller's auction. Motivated by blockchain auctions, online…

Computer Science and Game Theory · Computer Science 2026-05-22 Jingyi Liu , Aviad Rubinstein , Ertem Nusret Tas , S. Matthew Weinberg , Qianfan Zhang

Good economic mechanisms depend on the preferences of participants in the mechanism. For example, the revenue-optimal auction for selling an item is parameterized by a reserve price, and the appropriate reserve price depends on how much the…

Computer Science and Game Theory · Computer Science 2014-06-10 Shuchi Chawla , Jason Hartline , Denis Nekipelov

We consider the problem of the optimization of bidding strategies in prior-dependent revenue-maximizing auctions, when the seller fixes the reserve prices based on the bid distributions. Our study is done in the setting where one bidder is…

Computer Science and Game Theory · Computer Science 2019-05-15 Thomas Nedelec , Noureddine El Karoui , Vianney Perchet

The standard framework of online bidding algorithm design assumes that the seller commits himself to faithfully implementing the rules of the adopted auction. However, the seller may attempt to cheat in execution to increase his revenue if…

Computer Science and Game Theory · Computer Science 2023-11-28 Qian Wang , Xuanzhi Xia , Zongjun Yang , Xiaotie Deng , Yuqing Kong , Zhilin Zhang , Liang Wang , Chuan Yu , Jian Xu , Bo Zheng

The use of game theoretic methods for control in multiagent systems has been an important topic in recent research. Valid utility games in particular have been used to model real-world problems; such games have the convenient property that…

Computer Science and Game Theory · Computer Science 2022-09-16 David Grimsman , Philip N. Brown , Jason R. Marden

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

Theoretical Economics · Economics 2020-08-27 Alex Suzdaltsev

In this work we introduce a new class of mechanisms composed of a traditional Generalized Second Price (GSP) auction and a fair division scheme, in order to achieve some desired level of fairness between groups of Bayesian strategic…

Computer Science and Game Theory · Computer Science 2022-10-19 Georgios Birmpas , Andrea Celli , Riccardo Colini-Baldeschi , Stefano Leonardi

A special case of Myerson's classic result describes the revenue-optimal equilibrium when a seller offers a single item to a buyer. We study a repeated sales extension of this model: a seller offers to sell a single fresh copy of an item to…

Computer Science and Game Theory · Computer Science 2019-03-12 Nikhil R. Devanur , Yuval Peres , Balasubramanian Sivan

Traditional economic models typically treat private information, or signals, as generated from some underlying state. Recent work has explicated alternative models, where signals correspond to interpretations of available information. We…

Computer Science and Game Theory · Computer Science 2012-02-20 Michael P. Wellman , Lu Hong , Scott E. Page

On ad exchange platforms the place for advertisement is sold through different kinds of auctions. However, it is not uncommon the situation where the seller repeatedly encounters only one buyer, thus the posted price auction degenerates…

Computer Science and Game Theory · Computer Science 2019-02-05 Nikita Kalinin

In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret,…

Computer Science and Game Theory · Computer Science 2012-08-07 Paul Duetting , Felix Fischer , Pitchayut Jirapinyo , John K. Lai , Benjamin Lubin , David C. Parkes

Recent literature highlights the advantages of implementing social rules via dynamic game forms. We characterize when truth-telling remains a dominant strategy in gradual mechanisms implementing strategy-proof social rules, where agents…

Theoretical Economics · Economics 2025-03-27 Wenqian Wang , Zhiwen Zheng

We study revenue optimization pricing algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation. We show that, in the case when both the seller and the buyer…

Computer Science and Game Theory · Computer Science 2018-05-08 Arsenii Vanunts , Alexey Drutsa

To select a subset of samples or "winners" from a population of candidates, order sampling [Rosen 1997] and the k-unit Myerson auction [Myerson 1981] share a common scheme: assign a (random) score to each candidate, then select the k…

Computer Science and Game Theory · Computer Science 2018-11-29 Shaddin Dughmi , David Kempe , Ruixin Qiang

This paper builds a model of interactive belief hierarchies to derive the conditions under which judging an arbitrage opportunity requires Bayesian market participants to exercise their higher-order beliefs. As a Bayesian, an agent must…

Theoretical Economics · Economics 2022-11-08 Ayan Bhattacharya

Auction is applied for trade with various mechanisms. A simple but practical question is which mechanism, typically first-price or second-price auctions, is preferred from the perspective of bidders or sellers. A celebrated answer is…

Computer Science and Game Theory · Computer Science 2026-02-20 Yuma Fujimoto , Kaito Ariu , Kenshi Abe

Imitation is widely observed in populations of decision-making agents. Using our recent convergence results for asynchronous imitation dynamics on networks, we consider how such networks can be efficiently driven to a desired equilibrium…

Computer Science and Game Theory · Computer Science 2017-04-17 James Riehl , Pouria Ramazi , Ming Cao

We revisit the classic problem of fair division from a mechanism design perspective, using {\em Proportional Fairness} as a benchmark. In particular, we aim to allocate a collection of divisible items to a set of agents while incentivizing…

Computer Science and Game Theory · Computer Science 2014-02-26 Richard Cole , Vasilis Gkatzelis , Gagan Goel

Exchange markets are a significant type of market economy, in which each agent holds a budget and certain (divisible) resources available for trading. Most research on equilibrium in exchange economies is based on an environment of…

Computer Science and Game Theory · Computer Science 2024-10-10 Yusen Zheng , Yukun Cheng , Chenyang Xu , Xiaotie Deng

We propose and study a novel mechanism design setup where each bidder holds two kinds of private information: (1) type variable, which can be misreported; (2) information variable, which the bidder may want to conceal or partially reveal,…

Computer Science and Game Theory · Computer Science 2023-01-31 Jibang Wu , Ashwinkumar Badanidiyuru , Haifeng Xu