English
Related papers

Related papers: Identification of Auction Models Using Order Stati…

200 papers

Equilibria in auctions can be very difficult to analyze, beyond the symmetric environments where revenue equivalence renders the analysis straightforward. This paper takes a robust approach to evaluating the equilibria of auctions. Rather…

Computer Science and Game Theory · Computer Science 2023-10-06 Jason Hartline , Darrell Hoy , Samuel Taggart

We consider the fundamental problem of designing a truthful single-item auction with the challenging objective of extracting a large fraction of the highest agent valuation as revenue. Following a recent trend in algorithm design, we assume…

Computer Science and Game Theory · Computer Science 2024-01-25 Ioannis Caragiannis , Georgios Kalantzis

Repeated multi-unit auctions, where a seller allocates multiple identical items over many rounds, are common mechanisms in electricity markets and treasury auctions. We compare the two predominant formats: uniform-price and discriminatory…

Computer Science and Game Theory · Computer Science 2025-10-23 Marius Potfer , Vianney Perchet

We consider the question of whether collusion among bidders (a "bidding ring") can be supported in equilibrium of unrepeated first-price auctions. Unlike previous work on the topic such as that by McAfee and McMillan [1992] and Marshall and…

Computer Science and Game Theory · Computer Science 2016-08-31 Kevin Leyton-Brown , Moshe Tennenholtz , Navin Bhat , Yoav Shoham

In a model with no given probability measure, we consider asset pricing in the presence of frictions and other imperfections and characterize the property of coherent pricing, a notion related to (but much weaker than) the no arbitrage…

Mathematical Finance · Quantitative Finance 2016-09-12 Gianluca Cassese

We address online learning in complex auction settings, such as sponsored search auctions, where the value of the bidder is unknown to her, evolving in an arbitrary manner and observed only if the bidder wins an allocation. We leverage the…

Computer Science and Game Theory · Computer Science 2018-06-04 Zhe Feng , Chara Podimata , Vasilis Syrgkanis

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

We investigate approximately optimal mechanisms in settings where bidders' utility functions are non-linear; specifically, convex, with respect to payments (such settings arise, for instance, in procurement auctions for energy). We provide…

Computer Science and Game Theory · Computer Science 2017-02-23 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

Traditional economic models typically treat private information, or signals, as generated from some underlying state. Recent work has explicated alternative models, where signals correspond to interpretations of available information. We…

Computer Science and Game Theory · Computer Science 2012-02-20 Michael P. Wellman , Lu Hong , Scott E. Page

We consider an auction design problem where a seller sells multiple homogeneous items to a set of connected buyers. Each buyer only knows the buyers she directly connects with and has a diminishing marginal utility valuation for the items.…

Computer Science and Game Theory · Computer Science 2023-02-28 Haolin Liu , Xinyuan Lian , Dengji Zhao

We study a market for private data in which a data analyst publicly releases a statistic over a database of private information. Individuals that own the data incur a cost for their loss of privacy proportional to the differential privacy…

Computer Science and Game Theory · Computer Science 2012-10-01 Pranav Dandekar , Nadia Fawaz , Stratis Ioannidis

We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, the competitive ratio of our algorithm tends to 1, as the…

Computer Science and Game Theory · Computer Science 2009-01-13 Sourav Chakraborty , Nikhil Devanur

Finite mixture models are useful in applied econometrics. They can be used to model unobserved heterogeneity, which plays major roles in labor economics, industrial organization and other fields. Mixtures are also convenient in dealing with…

Econometrics · Economics 2018-11-08 Yuichi Kitamura , Louise Laage

With the increasing use of auctions in online advertising, there has been a large effort to study seller revenue maximization, following Myerson's seminal work, both theoretically and practically. We take the point of view of the buyer in…

Computer Science and Game Theory · Computer Science 2019-03-27 Marc Abeille , Clément Calauzènes , Noureddine El Karoui , Thomas Nedelec , Vianney Perchet

We provide the first analysis of (deferred acceptance) clock auctions in the learning-augmented framework. These auctions satisfy a unique list of appealing properties, including obvious strategyproofness, transparency, and unconditional…

Computer Science and Game Theory · Computer Science 2024-11-06 Vasilis Gkatzelis , Daniel Schoepflin , Xizhi Tan

We study the asymptotic average-case efficiency of static and anonymous posted prices for $n$ agents and $m(n)$ multiple identical items with $m(n)=o\left(\frac{n}{\log n}\right)$. When valuations are drawn i.i.d from some fixed continuous…

Computer Science and Game Theory · Computer Science 2019-01-09 Urban Larsson , Ron Lavi

Consider the problem of allocating goods to buyers through an auction. An auction is efficient if the resulting allocation maximizes total welfare, conditional on the information available. If buyers have private values, the…

Computer Science and Game Theory · Computer Science 2018-05-23 Andrei Ciupan

We study buyer-optimal procurement mechanisms when quality is contractible. When some costs are borne by every participant of a procurement auction regardless of winning, the classic analysis should be amended. We show that an optimal…

Theoretical Economics · Economics 2024-11-20 Pasha Andreyanov , Ilia Krasikov , Alex Suzdaltsev

We study the problem of sorting under incomplete information, when queries are used to resolve uncertainties. Each of $n$ data items has an unknown value, which is known to lie in a given interval. We can pay a query cost to learn the…

Data Structures and Algorithms · Computer Science 2021-04-16 Magnús M. Halldórsson , Murilo S. de Lima

In this paper, we use a probabilistic model to estimate the number of uncorrelated features in a large dataset. Our model allows for both pairwise feature correlation (collinearity) and interdependency of multiple features…

Machine Learning · Computer Science 2023-09-26 Ghurumuruhan Ganesan