Author
Listed:
- Liang Kuang Tai
(Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R. O. C.)
- Arbee L. P. Chen
(Department of Computer Science and Information Engineering, Asia University, Taichung, Taiwan, R. O. C.)
Abstract
For a company, it is important to know which products to launch to the market that may get the maximal profit. To achieve this goal, companies not only need to consider these products’ features, but also need to analyze how customers make their purchase decisions. For most customers, the price of a product is the most important purchase factor. If the price of a product can be adjusted, the purchase decision of a customer may change. With different price settings, we can speculate on the expected number of customers and the profit of the products. Motivated by this, we want to find the most profitable products among the candidates for the company. A distance-based adoption model can be used to evaluate the expected customers for products at different prices. The computational cost is high in two parts. One is the computational cost of obtaining the most profitable information on each set of candidate products. Another part is that many candidate product combinations need to be calculated. To tackle the computation problem, we propose two strategies. One is to avoid considering all possible price settings. The other is to avoid processing all possible subsets of the candidate products. Experimental results reveal the efficiency of our strategies.
Suggested Citation
Liang Kuang Tai & Arbee L. P. Chen, 2024.
"Strategies to Selecting Most Profitable Products by Price Settings,"
International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 23(02), pages 885-915, March.
Handle:
RePEc:wsi:ijitdm:v:23:y:2024:i:02:n:s0219622023500438
DOI: 10.1142/S0219622023500438
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijitdm:v:23:y:2024:i:02:n:s0219622023500438. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.