Graph pricing with limited supply

DOI10.1007/978-3-030-83508-8_29OpenAlexW3197169649MaRDI QIDQ832882FDOQ832882

Authors: Zachary Friggstad, Maryam Mahboub 

Publication date: 25 March 2022

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

zbMATH Keywords

linear programminglocal searchapproximation algorithmscapacitated pricinggraph pricing

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites Work

• On profit-maximizing envy-free pricing
• Single-minded unlimited supply pricing on sparse instances
• A sublogarithmic approximation for highway and tollbooth pricing
• Pricing on paths: a PTAS for the highway problem
• Title not available (Why is that?)
• Regular Graphs with Given Girth and Restricted Circuits
• Approximation algorithms and online mechanisms for item pricing
• Improved hardness results for profit maximization pricing problems with unlimited supply
• On Hardness of Pricing Items for Single-Minded Bidders
• Complexity of local search for the \(p\)-median problem
• Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
• Hardness of Graph Pricing Through Generalized Max-Dicut

This page was built for publication: Graph pricing with limited supply

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832882)