By Topic

Envy free chain store pricing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Fazli, M. ; Dept. of Comput. Eng., Sharif Univ. of Technol., Tehran, Iran ; Nikparto, N. ; Saghafian, M.

In this paper we study envy free pricing problem in general graphs where there is not a seller in every graph's nodes. We assume unique establishment cost for initiating a store in each node and we wish to find an optimal set of nodes in which we would make the maximum profit by initiating stores in them. Our model is motivated from the observation that a same product has different prices in different locations and there is also an establishing cost for initiating any store. We consider both of these issues in our model: first where should we establish the stores, and second at what price should we sell our items in them to gain maximum possible profit. We prove that in a case of constant price our problem is NP-Hard and we present a (1 - 1/e)-approximation algorithm for solving “Equal prices-Equal costs” and “Equal prices-Difference costs” versions of this problem.

Published in:

Computer Science and Software Engineering (CSSE), 2011 CSI International Symposium on

Date of Conference:

15-16 June 2011