Public Projects, Boolean Functions, and the Borders of Border's Theorem

@article{Gopalan2015PublicPB,
  title={Public Projects, Boolean Functions, and the Borders of Border's Theorem},
  author={Parikshit Gopalan and Noam Nisan and Tim Roughgarden},
  journal={Proceedings of the Sixteenth ACM Conference on Economics and Computation},
  year={2015}
}
Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known generalizations of Border's theorem either restrict attention to relatively simple settings, or resort to approximation. This paper identifies a complexity-theoretic barrier that indicates, assuming standard complexity class separations, that Border's theorem cannot be… 
View on ACM
arxiv.org
25 Citations
Highly Influential Citations
1
Background Citations
9
Methods Citations
6
Results Citations
2

25 Citations

Fast Algorithms for Computing Interim Allocations in Single-Parameter Environments

Motivated by the simplicity and transparency of Myerson’s analysis, fast algorithms for computing interim allocations in simple auction settings are presented, and yield ex-ante symmetric solutions to surplus and revenue maximization.

Towards Simple Polynomial-Time Optimal Auctions

Border’s theorem gives us a way of solving mechanism design problems in polynomial time. This approach requires the use of linear programming machinery, the mechanics of which are significantly more…

Ironing the Border: Optimal Auctions for Negatively Correlated Items

This paper obtains the closed-form optimal auction for this setting, by directly addressing the two difficulties above, and proves a generalization of Border's theorem and shows that optimal interim allocation is indeed monotone in the virtual value.

Optimized Pointwise Maximization : A Polynomial-Time Method

Border’s theorem gives us a way of solving mechanism design problems in polynomial time. This approach requires the use of linear programming machinery, the mechanics of which are significantly more…

Greedy Allocations and Equitable Matchings

I study multi-item allocation problems when agents have capacity constraints. I first provide an approximate extension to the multi-item setting of Border’s characterization of realizable interim…

Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice

An efficient algorithm is given that constructs winner-selecting dice for any feasible interim rule, and when the types of the candidates are drawn in an i.i.d.~manner and the interim rule is symmetric across candidates, unsurprisingly, an algorithm can efficiently construct symmetric dice.

Est : Auctions , Persuasion , Interim Rules , and

This work examines the existence of winner-selecting dice that implement prescribed probabilities of winning (i.e., an interim rule) for all types, and shows that when the feasibility constraint is a matroid, then for any feasible interim rule, there always exist winner- selecting Dice that implement it.

Optimal Auctions for Negatively Correlated Items

The first instance where a Bayesian IC auction yields strictly more revenue than any IC auction is witnessed, resolving an important conjecture concerning whether there exists a quasi-linear setting where the optimal revenues differ under the two different solution concepts.

Costly verification in collective decisions

This work characterized the mechanism that maximizes the expected utility of the principal and implemented as a cardinal voting rule, in which agents can either cast a baseline vote, indicating only whether they are in favor of the new policy, or they make specific claims about their type.

Algorithmic information structure design: a survey

This monograph divides information structure design into single agent and multiple agent models, and further subdivides the multiple agent case into the public channel and private channel modes of information revelation.

References

SHOWING 1-10 OF 33 REFERENCES

The Complexity of Optimal Mechanism Design

It is shown that a revenue-optimal auction in multi-item settings cannot be found and implemented computationally efficiently, unless ZPP ⊇ P#P, which is true even for a single additive bidder whose values for the items are independently distributed on two rational numbers with rational probabilities.

An algorithmic characterization of multi-dimensional mechanisms

The results provide a characterization of feasible, Bayesian Incentive Compatible mechanisms in multi-item multi-bidder settings, and give a proper generalization of Border's Theorem for a broader class of feasibility constraints, including the intersection of any two matroids.

Designing and learning optimal finite support auctions

This paper demonstrates that a Myerson-style auction can be constructed in time polynomial in the number of bidders and the size of the support sets and shows that the optimal mechanism is an order-based auction and is used to prove the correctness of the learning algorithm as well as to bound its running time.

Barriers to Near-Optimal Equilibria

  • T. Roughgarden
  • Economics
    2014 IEEE 55th Annual Symposium on Foundations of Computer Science
  • 2014
The results imply that the simultaneous first-price auction format is optimal among all "simple combinatorial auctions" in several settings, and this framework gives three families of lower bounds on the quality of equilibria, each motivated by a different set of problems.

Why prices need algorithms

This note surveys the main result from [Roughgarden and Talgam-Cohen 2015], which shows that the existence of pricing equilibria is inextricably connected to the computational complexity of related optimization problems: demand oracles, revenue- maximization and welfare-maximization.

Optimal auctions with correlated bidders are easy

It is shown that in the oracle model introduced by Ronen and Saberi [FOCS'02], there exists a polynomial time truthful in expectation mechanism that provides a (1.5+ε)-approximation to the revenue achievable by an optimal truthful-in-expectation mechanism, and a poynomial time deterministic truthful mechanism that guarantees 5/3 approximation.

The Complexity of Optimal Multidimensional Pricing

It is shown that the problem of computing a revenue-optimal pricing can be solved in polynomial time for distributions of support size 2 and its decision version is NP-complete for distributionsof support size 3.

Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization

The results are computationally efficient for all multidimensional settings where the bidders are additive, or can be efficiently mapped to be additive, albeit the feasibility and demand constraints may still remain arbitrary combinatorial.

Optimal Auctions with Risk Averse Buyers

THIS PAPER STUDIES AUCTIONS designed to maximize the expected revenue of a seller facing risk averse bidders with unknown preferences.2 Although we concentrate on auctions where a seller sells a…

Bayesian optimal auctions via multi- to single-agent reduction

An abstract optimal auction problem for selecting a subset of self-interested agents to whom to provide a service, and shows that interim feasible allocation rules can be optimized over and implemented via a linear program that has quadratic complexity in the sum of the sizes of the individual agents' type spaces.