中文
相关论文

相关论文: Truthful Bilateral Trade is Impossible even with F…

200 篇论文

We consider a revenue optimizing seller selling a single item to a buyer, on whose private value the seller has a noisy signal. We show that, when the signal is kept private, arbitrarily more revenue could potentially be extracted than if…

计算机科学与博弈论 · 计算机科学 2017-07-20 Hu Fu , Chris Liaw , Pinyan Lu , Zhihao Gavin Tang

In a seminal paper, McAfee (1992) presented the first dominant strategy truthful mechanism for double auction. His mechanism attains nearly optimal gain-from-trade when the market is sufficiently large. However, his mechanism may leave…

计算机科学与博弈论 · 计算机科学 2016-09-07 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

We study revenue optimization in a repeated auction between a single seller and a single buyer. Traditionally, the design of repeated auctions requires strong modeling assumptions about the bidder behavior, such as it being myopic, infinite…

计算机科学与博弈论 · 计算机科学 2019-03-12 Shipra Agrawal , Constantinos Daskalakis , Vahab Mirrokni , Balasubramanian Sivan

In this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ranking over purchasing either one of these items at its given…

计算机科学与博弈论 · 计算机科学 2020-10-16 Will Ma

We present different versions of a conjecture which would express that first price mechanisms never work very badly in a very general class of problems. The definitions include most of the problems where there is a principal (seller) who…

经济学 · 定量金融 2015-09-01 Endre Csóka

Consider a market where a seller owns an item for sale and a buyer wants to purchase it. Each player has private information, known as their type. It can be costly and difficult for the players to reach an agreement through direct…

计算机科学与博弈论 · 计算机科学 2024-10-29 Zhikang Fan , Weiran Shen

Classic no-trade theorems attribute trade to heterogeneous beliefs. We re-examine this conclusion for AI agents, asking if trade can arise from computational limitations, under common beliefs. We model agents' bounded computational…

计算机科学与博弈论 · 计算机科学 2025-12-23 Hanyu Li , Xiaotie Deng

We revisit the well-studied problem of designing mechanisms for one-sided matching markets, where a set of $n$ agents needs to be matched to a set of $n$ heterogeneous items. Each agent $i$ has a value $v_{i,j}$ for each item $j$, and these…

计算机科学与博弈论 · 计算机科学 2020-01-22 Rediet Abebe , Richard Cole , Vasilis Gkatzelis , Jason D. Hartline

We study the design of prior-independent auctions in a setting with heterogeneous bidders. In particular, we consider the setting of selling to $n$ bidders whose values are drawn from $n$ independent but not necessarily identical…

计算机科学与博弈论 · 计算机科学 2023-11-08 Guru Guruganesh , Aranyak Mehta , Di Wang , Kangning Wang

This paper studies learning in markets with aggregate uncertainty about whether trade is efficient. A long-lived seller offers prices to buyers, who are short-lived and arrive according to a Poisson process. A hidden state determines…

理论经济学 · 经济学 2026-01-14 Justus Preusser

The declining price anomaly states that the price weakly decreases when multiple copies of an item are sold sequentially over time. The anomaly has been observed in a plethora of practical applications. On the theoretical side, Gale and…

计算机科学与博弈论 · 计算机科学 2019-05-03 Vishnu V. Narayan , Enguerrand Prebet , Adrian Vetta

Multi-item mechanisms can be very complex offering many different bundles to the buyer that could even be randomized. Such complexity is thought to be necessary as the revenue gaps between randomized and deterministic mechanisms, or…

计算机科学与博弈论 · 计算机科学 2019-07-03 Shuchi Chawla , Yifeng Teng , Christos Tzamos

We study a bilateral trade problem where a principal has private information that is revealed with delay, such as a seller who does not yet know her production cost. Postponing the contracting process incurs a costly delay, while early…

理论经济学 · 经济学 2024-08-05 Francesco Giovannoni , Toomas Hinnosaar

We consider the classical mathematical economics problem of {\em Bayesian optimal mechanism design} where a principal aims to optimize expected revenue when allocating resources to self-interested agents with preferences drawn from a known…

计算机科学与博弈论 · 计算机科学 2010-01-15 Shuchi Chawla , Jason Hartline , David Malec , Balasubramanian Sivan

We consider the well known, and notoriously difficult, problem of a single revenue-maximizing seller selling two or more heterogeneous goods to a single buyer whose private values for the goods are drawn from a (possibly correlated) known…

计算机科学与博弈论 · 计算机科学 2022-09-23 Sergiu Hart , Noam Nisan

The impossibility theorem in Roth (1982) states that no stable mechanism satisfies strategy-proofness. This paper explores the Machiavellian frontier of stable mechanisms by weakening strategy-proofness. For a fixed mechanism $\varphi$ and…

理论经济学 · 经济学 2024-07-15 Qiufu Chen , Yuanmei Li , Xiaopeng Yin , Luosai Zhang , Siyi Zhou

Separate selling of two independent goods is shown to yield at least 62% of the optimal revenue, and at least 73% when the goods satisfy the Myerson regularity condition. This improves the 50% result of Hart and Nisan (2017, originally…

计算机科学与博弈论 · 计算机科学 2022-09-23 Sergiu Hart , Philip J. Reny

We consider the problem of designing revenue-optimal auctions for selling two items and bidders' valuations are independent among bidders but negatively correlated among items. In this paper, we obtain the closed-form optimal auction for…

计算机科学与博弈论 · 计算机科学 2016-06-03 Pingzhong Tang , Zihe Wang

We construct an empirically founded model of a repo trade intermediated by two broker-dealers and prove multiple equilibrium and the existence of equilibrium at the joint profit maximizing volume of trade. We then present a smart contract…

理论经济学 · 经济学 2026-04-21 Daniel Aronoff , Robert M. Townsend

In budget-feasible mechanism design, a buyer wishes to procure a set of items of maximum value from self-interested players. We have a valuation function $v:2^U \to \mathbb{R}_+$, where $U$ is the set of all items, where $v(S)$ specifies…

计算机科学与博弈论 · 计算机科学 2026-03-25 Rian Neogi , Kanstantsin Pashkovich , Chaitanya Swamy