English
Related papers

Related papers: Two-Price Equilibrium

200 papers

We consider the problem of finding the (unique) minimal Walrasian equilibrium price in multi-item, multi-unit auction models: there are multiple indivisible items for sale, with several units of each item, and a bidder may be interested in…

Combinatorics · Mathematics 2026-05-01 Kazuo Murota , Akiyoshi Shioura

To determine the welfare implications of price changes in demand data, we introduce a revealed preference relation over prices. We show that the absence of cycles in this relation characterizes a consumer who trades off the utility of…

Econometrics · Economics 2024-07-03 Rahul Deb , Yuichi Kitamura , John K. -H. Quah , Jörg Stoye

We study combinatorial auctions with bidders that exhibit endowment effect. In most of the previous work on cognitive biases in algorithmic game theory (e.g., [Kleinberg and Oren, EC'14] and its follow-ups) the focus was on analyzing the…

Computer Science and Game Theory · Computer Science 2018-05-29 Moshe Babaioff , Shahar Dobzinski , Sigal Oren

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

The notion that economies should normally be in equilibrium is by now well-established; equally well-established is that economies are almost never precisely in equilibrium. Using a very general formulation, we show that under dynamics that…

General Finance · Quantitative Finance 2012-02-28 Eric Kemp-Benedict

Consider the seller's problem of finding optimal prices for her $n$ (divisible) goods when faced with a set of $m$ consumers, given that she can only observe their purchased bundles at posted prices, i.e., revealed preferences. We study…

Computer Science and Game Theory · Computer Science 2018-10-09 Ziwei Ji , Ruta Mehta , Matus Telgarsky

In two-sided markets, Myerson and Satterthwaite's impossibility theorem states that one can not maximize the gain-from-trade while also satisfying truthfulness, individual-rationality and no deficit. Attempts have been made to circumvent…

Computer Science and Game Theory · Computer Science 2019-12-10 Rica Gonen , Erel Segal-Halevi

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

We introduce uncertainty into a pure exchange economy and establish a connection between Shannon's differential entropy and uniqueness of price equilibria. The following conjecture is proposed under the assumption of a uniform probability…

Theoretical Economics · Economics 2021-02-22 Andrea Loi , Stefano Matta

This study constructs a novel analytical general equilibrium model to compare environmental policies in a setting where oligopolistic energy firms engage in third-degree price discrimination across residential consumers and industrial…

General Economics · Economics 2025-01-07 Tengjiao Chen , Daniel H. Karney

Online markets are a part of everyday life, and their rules are governed by algorithms. Assuming participants are inherently self-interested, well designed rules can help to increase social welfare. Many algorithms for online markets are…

Computer Science and Game Theory · Computer Science 2022-02-01 Kanstantsin Pashkovich , Xinyue Xie

We model the role of an online platform disrupting a market with unit-demand buyers and unit-supply sellers. Each seller can transact with a subset of the buyers whom she already knows, as well as with any additional buyers to whom she is…

Computer Science and Game Theory · Computer Science 2024-06-12 Luca D'Amico-Wong , Yannai A. Gonczarowski , Gary Qiurui Ma , David C. Parkes

We revisit the connection between bargaining and equilibrium in exchange economies, and study its algorithmic implications. We consider bargaining outcomes to be allocations that cannot be blocked (i.e., profitably re-traded) by coalitions…

Computer Science and Game Theory · Computer Science 2019-05-14 Siddharth Barman , Federico Echenique

We present a methodology to robustly estimate the competitive equilibria (CE) of combinatorial markets under the assumption that buyers do not know their precise valuations for bundles of goods, but instead can only provide noisy estimates.…

Computer Science and Game Theory · Computer Science 2021-01-26 Enrique Areyan Viqueira , Cyrus Cousins , Amy Greenwald

We study the problem of a seller dynamically pricing $d$ distinct types of indivisible goods, when faced with the online arrival of unit-demand buyers drawn independently from an unknown distribution. The goods are not in limited supply,…

Data Structures and Algorithms · Computer Science 2017-06-13 Aaron Roth , Aleksandrs Slivkins , Jonathan Ullman , Zhiwei Steven Wu

We study combinatorial auctions where each item is sold separately but simultaneously via a second price auction. We ask whether it is possible to efficiently compute in this game a pure Nash equilibrium with social welfare close to the…

Computer Science and Game Theory · Computer Science 2015-06-10 Shahar Dobzinski , Hu Fu , Robert Kleinberg

Throttling is a popular method of budget management for online ad auctions in which the platform modulates the participation probability of an advertiser in order to smoothly spend her budget across many auctions. In this work, we…

Computer Science and Game Theory · Computer Science 2023-02-07 Xi Chen , Christian Kroer , Rachitesh Kumar

Online marketplaces frequently run pricing experiments in environments where users choose from a list of items. In these settings, items compete for users' limited attention and demand, creating interference among items within a list:…

Econometrics · Economics 2026-03-17 Mahyar Habibi , Zahra Khanalizadeh , Negar Ziaeian

This paper studies equilibrium quality of semi-separable position auctions (known as the Ad Types setting) with greedy or optimal allocation combined with generalized second-price (GSP) or Vickrey-Clarke-Groves (VCG) pricing. We make three…

Computer Science and Game Theory · Computer Science 2021-03-11 Hadi Elzayn , Riccardo Colini-Baldeschi , Brian Lan , Okke Schrijvers

We study the Bayesian coarse correlated equilibrium (BCCE) of continuous and discretised first-price and all-pay auctions under the standard symmetric independent private-values model. Our study is motivated by the question of how the…

Computer Science and Game Theory · Computer Science 2024-11-19 Mete Şeref Ahunbay , Martin Bichler