Automata, Languages and Programming

DOI10.1007/b99859zbMath1099.91512MaRDI QIDQ5466539

Gagan Aggarwal, An Zhu, Tomás Feder, Rajeev Motwani

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

91B24: Microeconomic theory (price theory and economic markets)

68W25: Approximation algorithms

Related Items

On stackelberg pricing with computationally bounded customers, The Approximability of Assortment Optimization Under Ranking Preferences, Pricing bridges to cross a river, Envy-free pricing in multi-item markets, Efficient heuristic algorithms for maximum utility product pricing problems, Approximating the revenue maximization problem with sharp demands, Pricing commodities, Price strategy implementation, Optimal bundle pricing with monotonicity constraint, Reducing mechanism design to algorithm design via machine learning, Location, pricing and the problem of Apollonius, 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, The rank pricing problem with ties, Pricing lotteries, Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments, On social envy-freeness in multi-unit markets, Stackelberg network pricing games, Mixed-integer formulations for the capacitated rank pricing problem with envy, The Envy-Free Pricing Problem and Unit-Demand Markets