scientific article; zbMATH DE number 7053333
From MaRDI portal
zbMath1422.91290MaRDI QIDQ5743455
Noam Nisan, Hu Fu, Shahar Dobzinski, Ashwinkumar Badanidiyuru, Tim Roughgarden, Robert D. Kleinberg
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095197
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
The Limitations of Optimization from Samples, Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions, Submodular Functions: Learnability, Structure, and Optimization, Recognizing Coverage Functions, Optimization with demand oracles, Gross substitutability: an algorithmic survey, Unnamed Item, Approximate F_2-Sketching of Valuation Functions, The Complexity of Partial Function Extension for Coverage Functions, Economic efficiency requires interaction, Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions, Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization with demand oracles
- Mechanism design with a restricted action space
- Combinatorial auctions with decreasing marginal utilities
- Submodularity of Influence in Social Networks: From Local to Global
- Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
- Approximation algorithms for combinatorial auctions with complement-free bidders
- On the Computational Power of Demand Queries
- Two Randomized Mechanisms for Combinatorial Auctions
- Optimal Value of Information in Graphical Models
- An analysis of approximations for maximizing submodular set functions—I
- On Maximizing Welfare When Utility Functions Are Subadditive
- Learning submodular functions
