English
Related papers

Related papers: Approximately Efficient Bilateral Trade with Sampl…

200 papers

We study bilateral trade with a broker, where a buyer and seller interact exclusively through the broker. The broker strategically maximizes her payoff through arbitrage by trading with the buyer and seller at different prices. We study…

Computer Science and Game Theory · Computer Science 2025-01-09 Ilya Hajiaghayi , MohammadTaghi Hajiaghayi , Gary Peng , Suho Shin

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…

Computer Science and Game Theory · Computer Science 2017-07-20 Hu Fu , Chris Liaw , Pinyan Lu , Zhihao Gavin Tang

We study the limits of an information intermediary in the classical Bayesian auction, where a revenue-maximizing seller sells one item to $n$ buyers with independent private values. In addition, we have an intermediary who knows the buyers'…

Computer Science and Game Theory · Computer Science 2022-05-20 Reza Alijani , Siddhartha Banerjee , Kamesh Munagala , Kangning Wang

We initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is…

Theoretical Economics · Economics 2024-11-14 Simon Finster , Patrick Loiseau , Simon Mauras , Mathieu Molina , Bary Pradelski

We study no-money mechanisms for allocating indivisible items to strategic agents with additive preferences under a stochastic model. In this model, items' values are drawn from an underlying distribution and mechanisms are evaluated with…

Computer Science and Game Theory · Computer Science 2026-02-16 Daniel Halpern , Alexandros Psomas , Shirley Zhang

A central challenge in mechanism design is to develop truthful trade mechanisms that maximize the expected gains-from-trade (GFT) in two-sided markets with strategic agents. As achieving the full GFT is generally impossible, much of the…

Computer Science and Game Theory · Computer Science 2026-04-02 Moshe Babaioff , Aviad Rubinstein , Xizhi Tan , Kangning Wang

It has been assumed that arbitrage profits are not possible in efficient markets, because future prices are not predictable. Here we show that predictability alone is not a sufficient measure of market efficiency. We instead propose to…

Statistical Mechanics · Physics 2009-11-10 R. Rothenstein , K. Pawelzik

We consider a social planner faced with a stream of myopic selfish agents. The goal of the social planner is to maximize the social welfare, however, it is limited to using only information asymmetry (regarding previous outcomes) and cannot…

Computer Science and Game Theory · Computer Science 2019-05-15 Lee Cohen , Yishay Mansour

This paper proves that the welfare of the first price auction in Bayes-Nash equilibrium is at least a $.743$-fraction of the welfare of the optimal mechanism assuming agents' values are independently distributed. The previous best bound was…

Computer Science and Game Theory · Computer Science 2018-03-20 Darrell Hoy , Sam Taggart , Zihe Wang

This paper investigates the efficiency loss in social cost caused by strategic bidding behavior of individual participants in a supply-demand balancing market, and proposes a mechanism to fully recover equilibrium social optimum via…

Optimization and Control · Mathematics 2021-06-22 Kaiying Lin , Beibei Wang , Pengcheng You

We introduce a system of kinetic equations describing an exchange market consisting of two populations of agents (dealers and speculators) expressing the same preferences for two goods, but applying different strategies in their exchanges.…

General Finance · Quantitative Finance 2018-03-14 Carlo Brugna , Giuseppe Toscani

Cr\'emer and McLean [1985] showed that, when buyers' valuations are drawn from a correlated distribution, an auction with full knowledge on the distribution can extract the full social surplus. We study whether this phenomenon persists when…

Computer Science and Game Theory · Computer Science 2014-06-09 Hu Fu , Nima Haghpanah , Jason Hartline , Robert Kleinberg

This paper studies mechanism design for revenue maximization in a distribution-reporting setting, where the auctioneer does not know the buyers' true value distributions. Instead, each buyer reports and commits to a bid distribution in the…

Computer Science and Game Theory · Computer Science 2025-07-08 Xiaotie Deng , Yanru Guan , Ningyuan Li , Zihe Wang , Jie Zhang

We study a classical Bayesian mechanism design problem where a seller is selling multiple items to multiple buyers. We consider the case where the seller has costs to produce the items, and these costs are private information to the seller.…

Computer Science and Game Theory · Computer Science 2020-04-20 Yang Cai , Mingfei Zhao

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

A striking limitation of human cognition is our inability to execute some tasks simultaneously. Recent work suggests that such limitations can arise from a fundamental tradeoff in network architectures that is driven by the sharing of…

Neurons and Cognition · Quantitative Biology 2020-07-08 Yotam Sagiv , Sebastian Musslick , Yael Niv , Jonathan D. Cohen

This paper analyzes repeated version of the bilateral trade model where the independent payoff relevant private information of the buyer and the seller is correlated across time. Using this setup it makes the following five contributions.…

Theoretical Economics · Economics 2022-02-10 Rohit Lamba

We consider the revenue maximization problem of a monopolist via a non-Myersonian approach that could generalize to multiple items and multiple buyers. Although such an approach does not lead to any closed-form solution of the problem, it…

Computer Science and Game Theory · Computer Science 2017-11-30 Song Zuo

We study the problem of learning revenue-optimal multi-bidder auctions from samples when the samples of bidders' valuations can be adversarially corrupted or drawn from distributions that are adversarially perturbed. First, we prove tight…

Computer Science and Game Theory · Computer Science 2021-07-14 Wenshuo Guo , Michael I. Jordan , Manolis Zampetakis

We construct a model of an exchange economy in which agents trade assets contingent on an observable signal, the probability of which depends on public opinion. The agents in our model are replaced occasionally and each person updates…

Theoretical Economics · Economics 2022-04-28 Jean-Philippe Bouchaud , Roger Farmer
‹ Prev 1 4 5 6 7 8 10 Next ›