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, The Stackelberg minimum spanning tree game, On the complexity of the highway problem, Stackelberg network pricing games, COMPETITIVE ALGORITHMS FOR ONLINE PRICING