abstract

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

Authors:

Parikshit Gopalan,

Noam Nisan,

Tim RoughgardenAuthors Info & Claims

EC '15: Proceedings of the Sixteenth ACM Conference on Economics and Computation

Page 395

https://doi.org/10.1145/2764468.2764538

Published: 15 June 2015 Publication History

Get Access

Abstract

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 extended significantly beyond the state-of-the-art. We also identify a surprisingly tight connection between Myerson's optimal auction theory, when applied to public project settings, and some fundamental results in the analysis of Boolean functions.

Cited By

View all

Lang X(2022)Reduced-form budget allocation with multiple public alternativesSocial Choice and Welfare10.1007/s00355-022-01398-359:2(335-359)Online publication date: 14-Mar-2022
https://doi.org/10.1007/s00355-022-01398-3
Alaei SFu HHaghpanah NHartline JMalekian A(2019)Efficient Computation of Optimal Auctions via Reduced FormsMathematics of Operations Research10.1287/moor.2018.0958Online publication date: 30-May-2019
https://doi.org/10.1287/moor.2018.0958
Roughgarden T(2019)Complexity-Theoretic Barriers in EconomicsThe Future of Economic Design10.1007/978-3-030-18050-8_22(159-163)Online publication date: 16-Nov-2019
https://doi.org/10.1007/978-3-030-18050-8_22
Show More Cited By

Index Terms

Public Projects, Boolean Functions, and the Borders of Border's Theorem
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Public Projects, Boolean Functions, and the Borders of Border’s Theorem
Special Issue on EC'15

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’...
Isomorphism testing of Boolean functions computable by constant-depth circuits

Given two n-variable Boolean functions f and g, we study the problem of computing an ε-approximate isomorphism between them. An ε-approximate isomorphism is a permutation π of the n Boolean variables such that f ( x 1 , x 2 , , x n ) and g ( x π ( 1 ) , ...
Approximating Boolean Functions with Depth-2 Circuits

We study the complexity of approximating Boolean functions with disjunctive normal forms (DNFs) and other depth-2 circuits, exploring two main directions: universal bounds on the approximability of all Boolean functions, and the approximability of the parity ...

Comments

Information & Contributors

Information

Published In

EC '15: Proceedings of the Sixteenth ACM Conference on Economics and Computation

June 2015

852 pages

ISBN:9781450334105

DOI:10.1145/2764468

General Chair:
Tim Roughgarden
Stanford University, USA
,
Program Chairs:
Michal Feldman
Tel Aviv University, Israel
,
Michael Schwarz
Google, USA

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 June 2015

Check for updates

Author Tags

Qualifiers

Abstract

Conference

EC '15

Sponsor:

SIGecom

EC '15: ACM Conference on Economics and Computation

June 15 - 19, 2015

Oregon, Portland, USA

Acceptance Rates

EC '15 Paper Acceptance Rate 72 of 220 submissions, 33%;

Overall Acceptance Rate 664 of 2,389 submissions, 28%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
94
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lang X(2022)Reduced-form budget allocation with multiple public alternativesSocial Choice and Welfare10.1007/s00355-022-01398-359:2(335-359)Online publication date: 14-Mar-2022
https://doi.org/10.1007/s00355-022-01398-3
Alaei SFu HHaghpanah NHartline JMalekian A(2019)Efficient Computation of Optimal Auctions via Reduced FormsMathematics of Operations Research10.1287/moor.2018.0958Online publication date: 30-May-2019
https://doi.org/10.1287/moor.2018.0958
Roughgarden T(2019)Complexity-Theoretic Barriers in EconomicsThe Future of Economic Design10.1007/978-3-030-18050-8_22(159-163)Online publication date: 16-Nov-2019
https://doi.org/10.1007/978-3-030-18050-8_22
Greenwald ALee JOyakawa T(2018)Fast Algorithms for Computing Interim Allocations in Single-Parameter EnvironmentsPRIMA 2018: Principles and Practice of Multi-Agent Systems10.1007/978-3-030-03098-8_12(194-209)Online publication date: 24-Oct-2018
https://doi.org/10.1007/978-3-030-03098-8_12
Dughmi S(2017)Algorithmic information structure designACM SIGecom Exchanges10.1145/3055589.305559115:2(2-24)Online publication date: 24-Feb-2017
https://dl.acm.org/doi/10.1145/3055589.3055591
Tang PWang ZConitzer VBergemann DChen Y(2016)Optimal Auctions for Negatively Correlated ItemsProceedings of the 2016 ACM Conference on Economics and Computation10.1145/2940716.2940766(103-120)Online publication date: 21-Jul-2016
https://dl.acm.org/doi/10.1145/2940716.2940766
Dughmi SXu HWichs DMansour Y(2016)Algorithmic Bayesian persuasionProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897583(412-425)Online publication date: 19-Jun-2016
https://dl.acm.org/doi/10.1145/2897518.2897583

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations