English
Related papers

Related papers: Walrasian Dynamics in Multi-unit Markets

200 papers

We are interested in mechanisms that maximize social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the…

Computer Science and Game Theory · Computer Science 2008-10-20 Krzysztof R. Apt , Vangelis Markakis

The Walras approach to equilibrium focuses on the existence of market prices at which the total demands for goods are matched by the total supplies. Trading activities that might identify such prices by bringing agents together as potential…

Optimization and Control · Mathematics 2023-05-30 J. Deride , A. Jofré , R. T. Rockafellar

Following the work of Babaioff et al, we consider the pricing game with strategic vendors and a single buyer, modeling a scenario in which multiple competing vendors have very good knowledge of a buyer, as is common in online markets. We…

Computer Science and Game Theory · Computer Science 2016-02-10 Allan Borodin , Omer Lev , Tyrone Strangway

Quasiliearity is a ubiquitous and questionable assumption in the standard study of Walrasian equilibria. Quasilinearity implies that a buyer's value for goods purchased in a Walrasian equilibrium is always additive with goods purchased with…

Computer Science and Game Theory · Computer Science 2016-06-23 Rad Niazadeh , Christopher Wilkens

In this paper we define a new auction, called the Draw auction. It is based on the implementation of a draw when a minimum price of sale is not reached. We find that a Bayesian Nash equilibrium is reached in the Draw auction when each…

Computer Science and Game Theory · Computer Science 2024-03-14 Javier Castro , Rosa Espínola , Inmaculada Gutiérrez , Daniel Gómez

We introduce the study of designing allocation mechanisms for fairly allocating indivisible goods in settings with interdependent valuation functions. In our setting, there is a set of goods that needs to be allocated to a set of agents…

Computer Science and Game Theory · Computer Science 2023-05-24 Georgios Birmpas , Tomer Ezra , Stefano Leonardi , Matteo Russo

The introduction of aggregator structures has proven effective in bringing fairness to energy resource allocation by negotiating for more resources and economic surplus on behalf of users. This paper extends the fair energy resource…

Computer Science and Game Theory · Computer Science 2024-10-16 Jiayi Li , Matt Motoki , Baosen Zhang

We study the design of decision-making mechanism for resource allocations over a multi-agent system in a dynamic environment. Agents' privately observed preference over resources evolves over time and the population is dynamic due to the…

Systems and Control · Electrical Eng. & Systems 2020-05-20 Tao Zhang , Quanyan Zhu

The all-pay auction, a classic competitive model, is widely applied in scenarios such as political elections, sports competitions, and research and development, where all participants pay their bids regardless of winning or losing. However,…

Theoretical Economics · Economics 2025-07-24 Yan Liu , Ying Qin , Zihe Wang

A recent line of research has established a novel desideratum for designing approximately-revenue-optimal multi-item mechanisms, namely the buy-many constraint. Under this constraint, prices for different allocations made by the mechanism…

Computer Science and Game Theory · Computer Science 2024-05-17 Shuchi Chawla , Rojin Rezvan , Yifeng Teng , Christos Tzamos

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

Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate this as the problem of prior-free auction and focus on…

Computer Science and Game Theory · Computer Science 2009-09-30 Vahab Mirrokni , S. Muthukrishnan , Uri Nadav

The problem of robust dynamic pricing of an abstract commodity, whose inventory is specified at an initial time but never subsequently replenished, originally studied by Perakis and Sood (2006) in discrete time, is considered from the…

Optimization and Control · Mathematics 2012-09-04 Terry L. Friesz , Changhyun Kwon , Tae Il Kim , Lifan Fan , Tao Yao

In bandwidth allocation, competing agents wish to transmit data along paths of links in a network, and each agent's utility is equal to the minimum bandwidth she receives among all links in her desired path. Recent market mechanisms for…

Computer Science and Game Theory · Computer Science 2019-05-08 Benjamin Plaut

One attractive approach to market dynamics is the level $k$ model in which a level $0$ player adopts a very simple response to current conditions, a level $1$ player best-responds to a model in which others take level $0$ actions, and so…

Computer Science and Game Theory · Computer Science 2016-05-31 Krishnamurthy Dvijotham , Yuval Rabani , Leonard J. Schulman

We consider the optimal pricing problem for a model of the rich media advertisement market, as well as other related applications. In this market, there are multiple buyers (advertisers), and items (slots) that are arranged in a line such…

Computer Science and Game Theory · Computer Science 2013-08-07 Xiaotie Deng , Paul Goldberg , Yang Sun , Bo Tang , Jinshan Zhang

This study introduces an optimal mechanism in a dynamic stochastic knapsack environment. The model features a single seller who has a fixed quantity of a perfectly divisible item. Impatient buyers with a piece-wise linear utility function…

Computer Science and Game Theory · Computer Science 2024-02-23 Jihyeok Jung , Chan-Oi Song , Deok-Joo Lee , Kiho Yoon

We study equilibria in two-buyer sequential second-price (or first-price) auctions for identical goods. Buyers have weakly decreasing incremental values, and we make a behavioural no-overbidding assumption: the buyers do not bid above their…

Computer Science and Game Theory · Computer Science 2020-06-08 Mete Şeref Ahunbay , Brendan Lucier , Adrian Vetta

We study large markets with a single seller which can produce many types of goods, and many multi-minded buyers. The seller chooses posted prices for its many items, and the buyers purchase bundles to maximize their utility. For this…

Computer Science and Game Theory · Computer Science 2016-10-14 Elliot Anshelevich , Koushik Kar , Shreyas Sekar

We introduce draft auctions, which is a sequential auction format where at each iteration players bid for the right to buy items at a fixed price. We show that draft auctions offer an exponential improvement in social welfare at equilibrium…

Computer Science and Game Theory · Computer Science 2013-11-13 Nikhil R. Devanur , Jamie Morgenstern , Vasilis Syrgkanis