Economic efficiency requires interaction

DOI10.1145/2591796.2591815zbMATH Open1315.91027OpenAlexW2072617828MaRDI QIDQ5259557FDOQ5259557

Shahar Dobzinski, Noam Nisan, Sigal Oren

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2591796.2591815

zbMATH Keywords

matchingcommunication complexityauctions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Theory of Cryptography
• The geometry of differential privacy: the small database and approximate cases
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• On the complexity of differentially private data release
• Title not available (Why is that?)
• Collusion-secure fingerprinting for digital data
• Advances in Cryptology – CRYPTO 2004
• Title not available (Why is that?)
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Characterizing the sample complexity of private learners
• Faster Algorithms for Privately Releasing Marginals
• Faster private release of marginals on small databases
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately releasing conjunctions and the statistical query barrier
• Efficient algorithms for privately releasing marginals via convex relaxations

Cited In (4)

• Communication complexity of approximate maximum matching in the message-passing model
• A stable marriage requires communication
• Stable matching mechanisms are not obviously strategy-proof
• Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions

Uses Software

• SuLQ

   Recommendations

• Economic efficiency requires interaction 👍 👎
• Title not available (Why is that?) 👍 👎
• Cooperation and efficiency in markets 👍 👎
• Interaction between economic dynamical systems 👍 👎
• Interaction between economic dynamical systems 👍 👎
• Social interactions within a dynamic competitive economy 👍 👎
• Title not available (Why is that?) 👍 👎
• On efficiency in disagreement economies 👍 👎
• Efficient incentive compatible economies are perfectly competitive 👍 👎
• Complementarity, equilibrium, efficiency and economics 👍 👎

This page was built for publication: Economic efficiency requires interaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259557)