Related papers: Optimal Auctions for Correlated Buyers with Sampli…

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…

We provide a constructive proof of Border's theorem [Bor91, HR15a] and its generalization to reduced-form auctions with asymmetric bidders [Bor07, MV10, CKM13]. Given a reduced form, we identify a subset of Border constraints that are…

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…

This survey outlines a general and modular theory for proving approximation guarantees for equilibria of auctions in complex settings. This theory complements traditional economic techniques, which generally focus on exact and optimal…

A seller posts a price for a single object. The seller's and buyer's values may be interdependent. We characterize the set of payoff vectors across all information structures. Simple feasibility and individual-rationality constraints…

We examine trade-offs among stakeholders in ad auctions. Our metrics are the revenue for the utility of the auctioneer, the number of clicks for the utility of the users and the welfare for the utility of the advertisers. We show how to…

A diffusion auction refers to a selling process conducted over a social network, where each participant submits a bid and may invite other potential buyers to join the auction. Although various mechanisms have been proposed, none of them…

In "Recognizing the Maximum of a Sequence", Gilbert and Mosteller analyze a full information game where n measurements from an uniform distribution are drawn and a player (knowing n) must decide at each draw whether or not to choose that…

We describe an MCMC method for sampling distributions with soft constraints, which are constraints that are almost but not exactly satisfied. We sample a total distribution that is a convex combination of the target soft distribution with…

We study the problem of selling a resource through an auction mechanism. The winning buyer in turn develops this resource to generate profit. Two forms of payment are considered: charging the winning buyer a one-time payment, or an initial…

A prevalent assumption in auction theory is that the auctioneer has full control over the market and that the allocation she dictates is final. In practice, however, agents might be able to resell acquired items in an aftermarket. A…

This work proposes a bid shading strategy for first-price auctions as a measure-valued optimization problem. We consider a standard parametric form for bid shading and formulate the problem as convex optimization over the joint distribution…

Combinatorial auctions (CA) are a well-studied area in algorithmic mechanism design. However, contrary to the standard model, empirical studies suggest that a bidder's valuation often does not depend solely on the goods assigned to him. For…

We describe a general strategy for sampling configurations from a given distribution, NOT based on the standard Metropolis (Markov chain) strategy. It uses the fact that nontrivial problems in statistical physics are high dimensional and…

We consider a robust version of the revenue maximization problem, where a single seller wishes to sell $n$ items to a single unit-demand buyer. In this robust version, the seller knows the buyer's marginal value distribution for each item…

A common economic process is crowdsearch, wherein a group of agents is invited to search for a valuable physical or virtual object, e.g. creating and patenting an invention, solving an open scientific problem, or identifying vulnerabilities…

When agents with independent priors bid for a single item, Myerson's optimal auction maximizes expected revenue, whereas Vickrey's second-price auction optimizes social welfare. We address the natural question of trade-offs between the two…

In this work we introduce a new class of mechanisms composed of a traditional Generalized Second Price (GSP) auction and a fair division scheme, in order to achieve some desired level of fairness between groups of Bayesian strategic…

Motivated by sponsored search auctions, we study multi-unit auctions with budget constraints. In the mechanism we propose, Sort-Cut, understating budgets or values is weakly dominated. Since Sort-Cut's revenue is increasing in budgets and…

In this work, we study spectrum auction problem where each request from secondary users has spatial, temporal, and spectral features. With the requests of secondary users and the reserve price of the primary user, our goal is to design…