Revenue maximization with nonexcludable goods

DOI10.1007/978-3-642-45046-4_5MaRDI QIDQ2937745zbMATH OpenOpenAlexFDO

Authors MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam

Publication date 12 January 2015

Published in Web and Internet Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45046-4_5

zbMATH Keywords

hardness of approximationincentive compatibilitynonexcludable goodsrevenue maximization

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43) Public goods (91B18) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Optimal mechanism design for the private supply of a public good
• Efficient Mechanisms for Public Goods with Use Exclusions
• Auction-like mechanisms for pricing excludable public goods
• A two-dimensional problem of revenue maximization
• Approximate revenue maximization with multiple items

Cited in

(5)

• Cost-sharing mechanism for excludable goods with generalized non-rivalry
• To sell public or private goods
• Optimal mechanism design for the private supply of a public good
• Maximal revenue with multiple goods: Nonmonotonicity and other observations
• Approximation algorithms for pricing with negative network externalities

This page was built for publication: Revenue maximization with nonexcludable goods

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