Automata, Languages and Programming

DOI10.1007/b99859zbMath1099.91512OpenAlexW2505584480MaRDI QIDQ5466539

Gagan Aggarwal, An Zhu, Tomás Feder

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

Microeconomic theory (price theory and economic markets) (91B24) Approximation algorithms (68W25)

Related Items (20)

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

This page was built for publication: Automata, Languages and Programming