English
Related papers

Related papers: Two-Price Equilibrium

200 papers

We study a combinatorial market design problem, where a collection of indivisible objects is to be priced and sold to potential buyers subject to equilibrium constraints.The classic solution concept for such problems is Walrasian…

Computer Science and Game Theory · Computer Science 2013-04-09 Michal Feldman , Nick Gravin , Brendan Lucier

We study markets of indivisible items in which price-based (Walrasian) equilibria often do not exist due to the discrete non-convex setting. Instead we consider Nash equilibria of the market viewed as a game, where players bid for items,…

Computer Science and Game Theory · Computer Science 2011-03-22 Avinatan Hassidim , Haim Kaplan , Yishay Mansour , Noam Nisan

I introduce a concave function of allocations and prices -- the economy's potential -- which measures the difference between utilitarian social welfare and its dual. I show that Walrasian equilibria correspond to roots of the potential:…

Theoretical Economics · Economics 2022-10-27 Jacob K Goeree

Walrasian equilibrium prices can be said to coordinate markets: They support a welfare optimal allocation in which each buyer is buying bundle of goods that is individually most preferred. However, this clean story has two caveats. First,…

Computer Science and Game Theory · Computer Science 2018-03-16 Justin Hsu , Jamie Morgenstern , Ryan Rogers , Aaron Roth , Rakesh Vohra

In a Walrasian equilibrium (WE), all bidders are envy-free (EF), meaning that their allocation maximizes their utility; and the market clears (MC), meaning that the price of unallocated goods is zero. EF is desirable to ensure the long-term…

Computer Science and Game Theory · Computer Science 2017-08-11 Enrique Areyan Viqueira , Amy Greenwald , Victor Naroditskiy

We propose a new methodology to compute equilibria for general equilibrium problems on exchange economies with real financial markets, home-production, and retention. We demonstrate that equilibrium prices can be determined by solving a…

Optimization and Control · Mathematics 2025-06-23 Julio Deride

We use valid inequalities (cuts) of the binary integer program for winner determination in a combinatorial auction (CA) as "artificial items" that can be interpreted intuitively and priced to generate Artificial Walrasian Equilibria. We…

Theoretical Economics · Economics 2026-03-20 Robert Day , Benjamin Lubin

We study competition between firms in labor markets, following a combinatorial model suggested by Kelso and Crawford [1982]. In this model, each firm is trying to recruit workers by offering a higher salary than its competitors, and its…

Computer Science and Game Theory · Computer Science 2013-06-26 Reshef Meir , Moshe Tennenholtz

Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling…

Computer Science and Game Theory · Computer Science 2017-10-10 Simina Brânzei , Aris Filos-Ratsikas , Peter Bro Miltersen , Yulong Zeng

In various markets where sellers compete in price, price oscillations are observed rather than convergence to equilibrium. Such fluctuations have been empirically observed in the retail market for gasoline, in airline pricing and in the…

Computer Science and Game Theory · Computer Science 2015-04-28 Moshe Babaioff , Renato Paes Leme , Balasubramanian Sivan

We study the conflict between two links in a multiple-input single-output interference channel. This setting is strictly competitive and can be related to perfectly competitive market models. In such models, general equilibrium theory is…

Computer Science and Game Theory · Computer Science 2015-05-30 Rami Mochaourab , Eduard A. Jorswieck

We study algorithms for combinatorial market design problems, where a set of heterogeneous and indivisible objects are priced and sold to potential buyers subject to equilibrium constraints. Extending the CWE notion introduced by Feldman et…

Computer Science and Game Theory · Computer Science 2014-01-20 Michal Feldman , Brendan Lucier

We consider the resource allocation problem and its numerical solution. The following constructions are demonstrated: 1) Walrasian price-adjustment mechanism for determining the equilibrium; 2) Decentralized role of the prices; 3) Slater's…

Optimization and Control · Mathematics 2020-03-27 Anastasiya Ivanova , Alexander Gasnikov , Evgeni Nurminski , Evgeniya Vorontsova

We study the power of item-pricing as a tool for approximately optimizing social welfare in a combinatorial market. We consider markets with $m$ indivisible items and $n$ buyers. The goal is to set prices to the items so that, when agents…

Computer Science and Game Theory · Computer Science 2015-11-10 Michal Feldman , Nick Gravin , Brendan Lucier

Walrasian prices, if they exist, have the property that one can assign every buyer some bundle in her demand set, such that the resulting assignment will maximize social welfare. Unfortunately, this assumes carefully breaking ties amongst…

Computer Science and Game Theory · Computer Science 2018-06-06 Vincent Cohen-Addad , Alon Eden , Michal Feldman , Amos Fiat

We study market mechanisms for allocating divisible goods to competing agents with quasilinear utilities. For \emph{linear} pricing (i.e., the cost of a good is proportional to the quantity purchased), the First Welfare Theorem states that…

Computer Science and Game Theory · Computer Science 2020-09-22 Ashish Goel , Benjamin Plaut

Large-scale online recommendation systems must facilitate the allocation of a limited number of items among competing users while learning their preferences from user feedback. As a principled way of incorporating market constraints and…

Machine Learning · Computer Science 2022-12-15 Yigit Efe Erginbas , Soham Phade , Kannan Ramchandran

Central results in economics guarantee the existence of efficient equilibria for various classes of markets. An underlying assumption in early work is that agents are price-takers, i.e., agents honestly report their true demand in response…

Computer Science and Game Theory · Computer Science 2013-11-06 Moshe Babaioff , Brendan Lucier , Noam Nisan , Renato Paes Leme

We consider design of monetary mechanisms for two-sided matching. Mechanisms in the tradition of the deferred acceptance algorithm, even in variants incorporating money, tend to focus on the criterion of stability. Instead, in this work we…

Computer Science and Game Theory · Computer Science 2025-06-30 Robin Bowers , Bo Waggoner

We consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mechanism: given commonly known distributions of the buyer's…

Computer Science and Game Theory · Computer Science 2021-12-21 Zi Yang Kang , Francisco Pernice , Jan Vondrák
‹ Prev 1 2 3 10 Next ›