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)
Recommendations
- Economic efficiency requires interaction
- scientific article; zbMATH DE number 1361060
- Cooperation and efficiency in markets
- Interaction between economic dynamical systems
- Interaction between economic dynamical systems
- Social interactions within a dynamic competitive economy
- scientific article; zbMATH DE number 53507
- On efficiency in disagreement economies
- Efficient incentive compatible economies are perfectly competitive
- Complementarity, equilibrium, efficiency and economics
Cites work
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Differential privacy and the fat-shattering dimension of linear queries
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- Lower bounds in differential privacy
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
Cited in
(7)- Communication complexity of approximate maximum matching in the message-passing model
- Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions
- Economic efficiency requires interaction
- The communication requirements of efficient allocations and supporting prices
- A stable marriage requires communication
- Stable matching mechanisms are not obviously strategy-proof
- Improved truthful mechanisms for combinatorial auctions with submodular bidders
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)
