English
Related papers

Related papers: Uniform price auction with quantity constraints

200 papers

Budgets play a significant role in real-world sequential auction markets such as those implemented by internet companies. To maximize the value provided to auction participants, spending is smoothed across auctions so budgets are used for…

Computer Science and Game Theory · Computer Science 2021-05-11 Vincent Conitzer , Christian Kroer , Eric Sodomka , Nicolas E. Stier-Moses

We study a model of auction design where a seller is selling a set of objects to a set of agents who can be assigned no more than one object. Each agent's preference over (object, payment) pair need not be quasilinear. If the domain…

Theoretical Economics · Economics 2026-02-20 Tomoya Kazumura , Debasis Mishra , Shigehiro Serizawa

The enhanced competition paradigm is an attempt at bridging the gap between simple and optimal auctions. In this line of work, given an auction setting with $m$ items and $n$ bidders, the goal is to find the smallest $n' \geq n$ such that…

Computer Science and Game Theory · Computer Science 2021-05-19 Linda Cai , Raghuvansh R. Saxena

We study equilibrium in hedonic markets, when consumers and suppliers have reservation utilities, and the utility functions are separable with respect to price. There is one indivisible good, which comes in different qualities; each…

Trading and Market Microstructure · Quantitative Finance 2008-12-02 Ivar Ekeland

This paper develops algorithms to solve strong-substitutes product-mix auctions. That is, it finds competitive equilibrium prices and quantities for agents who use this auction's bidding language to truthfully express their…

Computer Science and Game Theory · Computer Science 2023-07-11 Elizabeth Baldwin , Paul W. Goldberg , Paul Klemperer , Edwin Lock

This paper studies markets where a set of indivisible items is sold to bidders with quasilinear, unit-demand valuations, subject to a hard budget constraint. Without financial constraints the well-known assignment market model of Shapley…

Computer Science and Game Theory · Computer Science 2025-07-16 Eleni Batziou , Martin Bichler , Maximilian Fichtl

The recent online platforms propose multiple items for bidding. The state of the art, however, is limited to the analysis of one item auction without resubmission. In this paper we study multi-item lowest unique bid auctions (LUBA) with…

Computer Science and Game Theory · Computer Science 2017-03-01 Yida Xu , Hamidou Tembine

Since economic mechanisms are often applied to very different instances of the same problem, it is desirable to identify mechanisms that work well in a wide range of circumstances. We pursue this goal for a position auction setting and…

Computer Science and Game Theory · Computer Science 2013-07-22 Paul Duetting , Felix Fischer , David C. Parkes

Classical optimal auction theory assumes that bids reach the seller directly. We study how this picture changes when a revenue-maximizing intermediary controls access to the seller's auction. Motivated by blockchain auctions, online…

Computer Science and Game Theory · Computer Science 2026-05-22 Jingyi Liu , Aviad Rubinstein , Ertem Nusret Tas , S. Matthew Weinberg , Qianfan Zhang

We study the price competition in a duopoly with an arbitrary number of buyers. Each seller can offer multiple units of a commodity depending on the availability of the commodity which is random and may be different for different sellers.…

Computer Science and Game Theory · Computer Science 2016-11-15 Mohammad Hassan Lotfi , Saswati Sarkar

This study explores the monotonicity of adaptive clinching auctions -- a key mechanism in budget-constrained auctions -- with respect to fluctuations in the number of bidders. Specifically, we investigate how the addition of new bidders…

Computer Science and Game Theory · Computer Science 2025-02-11 Ryosuke Sato

Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been a lot of attention on the auction process and its game-theoretic aspects, our focus is on the advertisers. In particular,…

Data Structures and Algorithms · Computer Science 2007-05-23 Jon Feldman , S. Muthukrishnan , Martin Pal , Cliff Stein

One method to offer some bidders a discount in a first-price auction is to augment their bids when selecting a winner but only charge them their original bids should they win. Another method is to use their original bids to select a winner,…

Computer Science and Game Theory · Computer Science 2024-03-12 Miguel Alcobendas , Eric Bax

Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each bidder offers a price for some subset of the available…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Karhan Akcoglu , James Aspnes , Bhaskar DasGupta , Ming-Yang Kao

We study the power and limitations of posted prices in multi-unit markets, where agents arrive sequentially in an arbitrary order. We prove upper and lower bounds on the largest fraction of the optimal social welfare that can be guaranteed…

Computer Science and Game Theory · Computer Science 2020-02-18 Tomer Ezra , Michal Feldman , Tim Roughgarden , Warut Suksompong

We consider a market where a set of objects is sold to a set of buyers, each equipped with a valuation function for the objects. The goal of the auctioneer is to determine reasonable prices together with a stable allocation. One definition…

Computer Science and Game Theory · Computer Science 2024-05-22 Katharina Eickhoff , S. Thomas McCormick , Britta Peis , Niklas Rieken , Laura Vargas Koch

We study competitive equilibrium in the canonical Fisher market model, but with indivisible goods. In this model, every agent has a budget of artificial currency with which to purchase bundles of goods. Equilibrium prices match between…

Computer Science and Game Theory · Computer Science 2019-11-25 Moshe Babaioff , Noam Nisan , Inbal Talgam-Cohen

We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-maximizing auctions under this communication restriction. For…

Computer Science and Game Theory · Computer Science 2011-10-13 L. Blumrosen , N. Nisan , I. Segal

In this paper, we revisit the common claim that double auctions necessarily generate competitive equilibria. We begin by observing that competitive equilibrium has some counterintuitive implications: specifically, it predicts that monotone…

Theoretical Economics · Economics 2022-09-19 Itzhak Rasooly

We study the pay-as-bid auction game, a supply function model with discriminatory pricing and asymmetric firms. In this game, strategies are non-decreasing supply functions relating pric to quantity and the exact choice of the strategy…

Optimization and Control · Mathematics 2025-04-23 Martina Vanelli , Giacomo Como , Fabio Fagnani