Approximation Algorithms for the Max-Buying Problem with Limited Supply

DOI10.1007/978-3-642-54423-1_61zbMath1406.91175OpenAlexW1693118193MaRDI QIDQ5405085

Cristina G. Fernandes, Rafael C. S. Schouery

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_61

zbMATH Keywords

approximation algorithmspricing problemunit-demand auctions

Mathematics Subject Classification ID

Microeconomic theory (price theory and economic markets) (91B24) Auctions, bargaining, bidding and selling, and other market models (91B26) Consumer behavior, demand theory (91B42) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

The envy-free pricing problem, unit-demand markets and connections with the network pricing problem ⋮ Approximation algorithms for the max-buying problem with limited supply

This page was built for publication: Approximation Algorithms for the Max-Buying Problem with Limited Supply