Approximation algorithms for the max-buying problem with limited supply

DOI10.1007/s00453-017-0364-7zbMath1412.91027arXiv1309.7955OpenAlexW2753515959WikidataQ111288192 ScholiaQ111288192MaRDI QIDQ1755724

Rafael C. S. Schouery, Cristina G. Fernandes

Publication date: 11 January 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.7955

zbMATH Keywords

approximation algorithmsrandomized algorithmspricingeconomics

Mathematics Subject Classification ID

Microeconomic theory (price theory and economic markets) (91B24) Auctions, bargaining, bidding and selling, and other market models (91B26) Consumer behavior, demand theory (91B42) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
• Algorithms for the Assignment and Transportation Problems
• A Nonparametric Approach to Multiproduct Pricing
• Uniform Budgets and the Envy-Free Pricing Problem
• Heuristics for the fixed cost median problem
• Approximation Algorithms for the Max-Buying Problem with Limited Supply
• Automata, Languages and Programming
• On a combinatorial game

This page was built for publication: Approximation algorithms for the max-buying problem with limited supply