scientific article
From MaRDI portal
Publication:3002785
DOI10.4086/toc.2007.v003a009zbMath1213.68699OpenAlexW1526218779MaRDI 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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmsonline optimizationrevenue maximizationcombinatorial auctionspricing problems
Computational learning theory (68Q32) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (18)
Graph pricing with limited supply ⋮ COMPETITIVE ALGORITHMS FOR ONLINE PRICING ⋮ Envy-free pricing with general supply constraints for unit demand consumers ⋮ Pricing loss leaders can be hard ⋮ The Stackelberg minimum spanning tree game ⋮ Stackelberg network pricing games ⋮ An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph ⋮ On stackelberg pricing with computationally bounded customers ⋮ The envy-free pricing problem, unit-demand markets and connections with the network pricing problem ⋮ On the complexity of the highway problem ⋮ Online pricing for multi-type of items ⋮ Unnamed Item ⋮ Optimal pricing of capacitated networks ⋮ Models and algorithms for the product pricing with single-minded customers requesting bundles ⋮ On envy-free revenue approximation for combinatorial buyers with budgets ⋮ Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets ⋮ Envy-free pricing in multi-item markets ⋮ Unnamed Item
This page was built for publication:
