How to Sell a Graph: Guidelines for Graph Retailers

DOI10.1007/11917496_12MaRDI QIDQ3522949zbMATH OpenOpenAlexFDO

Authors Alexander Grigoriev, Joyce van Loon, Marc Uetz, René A. Sitters

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitydynamic programmingfully polynomial time approximation schemehighway problempricing problemstollbooth problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Dynamic programming (90C39) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
• Optimal pricing of capacitated networks
• scientific article; zbMATH DE number 6292751
• On profit-maximizing pricing for the highway and tollbooth problems
• On Hardness of Pricing Items for Single-Minded Bidders

Cited in

(9)

• On fair price discrimination in multi-unit markets
• On social envy-freeness in multi-unit markets
• Optimal pricing of capacitated networks
• On the hardness of pricing loss-leaders
• The Stackelberg minimum spanning tree game
• On the complexity of the highway problem
• Online pricing for bundles of multiple items
• Optimal bundle pricing with monotonicity constraint
• Reducing mechanism design to algorithm design via machine learning

This page was built for publication: How to Sell a Graph: Guidelines for Graph Retailers

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