Publication:3002785
From MaRDI portal
DOI10.4086/toc.2007.v003a009zbMath1213.68699MaRDI QIDQ3002785
Maria-Florina Balcan, Avrim L. Blum
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2007.v003a009
approximation algorithms; online optimization; revenue maximization; combinatorial auctions; pricing problems
68Q32: Computational learning theory
91B26: Auctions, bargaining, bidding and selling, and other market models
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
On stackelberg pricing with computationally bounded customers, Optimal pricing of capacitated networks, Envy-free pricing in multi-item markets, An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph, The Stackelberg minimum spanning tree game, On the complexity of the highway problem, Online pricing for multi-type of items, Stackelberg network pricing games, Envy-free pricing with general supply constraints for unit demand consumers, Pricing loss leaders can be hard, Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets, COMPETITIVE ALGORITHMS FOR ONLINE PRICING