KnowGraph-PM: a Knowledge Graph based Pricing Model for Semiconductors Supply Chains

• URL: http://arxiv.org/abs/2205.07627v1
• Date: Fri, 13 May 2022 10:34:57 GMT
• Title: KnowGraph-PM: a Knowledge Graph based Pricing Model for Semiconductors Supply Chains
• Authors: Nour Ramzy, Soren Auer, Javad Chamanara, Hans Ehm
• Abstract summary: KnowGraph-PM is a knowledge graph-based dynamic pricing model. Price change potentially generates conflicts with customers. We demonstrate that semantic data integration enables customer-tailored revenue management.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Semiconductor supply chains are described by significant demand fluctuation that increases as one moves up the supply chain, the so-called bullwhip effect. To counteract, semiconductor manufacturers aim to optimize capacity utilization, to deliver with shorter lead times and exploit this to generate revenue. Additionally, in a competitive market, firms seek to maintain customer relationships while applying revenue management strategies such as dynamic pricing. Price change potentially generates conflicts with customers. In this paper, we present KnowGraph-PM, a knowledge graph-based dynamic pricing model. The semantic model uses the potential of faster delivery and shorter lead times to define premium prices, thus entail increased profits based on the customer profile. The knowledge graph enables the integration of customer-related information, e.g., customer class and location to customer order data. The pricing algorithm is realized as a SPARQL query that relies on customer profile and order behavior to determine the corresponding price premium. We evaluate the approach by calculating the revenue generated after applying the pricing algorithm. Based on competency questions that translate to SPARQL queries, we validate the created knowledge graph. We demonstrate that semantic data integration enables customer-tailored revenue management.

Related papers

• Transfer Learning for Nonparametric Contextual Dynamic Pricing [17.420508136662257]
  Dynamic pricing strategies are crucial for firms to maximize revenue by adjusting prices based on market conditions and customer characteristics. One promising approach to overcome this limitation is to leverage information from related products or markets to inform the focal pricing decisions. We propose a novel Transfer Learning for Dynamic Pricing (TLDP) algorithm that can effectively leverage pre-collected data from a source domain to enhance pricing decisions in the target domain.
  arXiv  Detail & Related papers  (2025-01-31T01:05:04Z)
• An Instrumental Value for Data Production and its Application to Data Pricing [107.98697414652479]
  This paper develops an approach for capturing the instrumental value of data production processes. We show how they connect to classic notions of information design and signals in information economics.
  arXiv  Detail & Related papers  (2024-12-24T03:53:57Z)
• Leveraging Microservices Architecture for Dynamic Pricing in the Travel Industry: Algorithms, Scalability, and Impact on Revenue and Customer Satisfaction [1.03590082373586]
  This research investigates the implementation of a real-time,-oriented dynamic pricing system for the travel sector. The system is designed to address factors such as demand, competitor pricing, and other external circumstances in real-time. Both controlled simulation and real-life application showed a respectable gain of 22% in revenue generation and a 17% improvement in pricing response time.
  arXiv  Detail & Related papers  (2024-11-03T17:24:02Z)
• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Personalized Federated Knowledge Graph Embedding with Client-Wise Relation Graph [49.66272783945571]
  We propose Personalized Federated knowledge graph Embedding with client-wise relation graph. PFedEG learns personalized supplementary knowledge for each client by amalgamating entity embedding from its neighboring clients. We conduct extensive experiments on four benchmark datasets to evaluate our method against state-of-the-art models.
  arXiv  Detail & Related papers  (2024-06-17T17:44:53Z)
• Causal Analysis of Customer Churn Using Deep Learning [9.84528076130809]
  Customer churn describes terminating a relationship with a business or reducing customer engagement over a specific period. This paper proposes a framework using a deep feedforward neural network for classification. We also propose a causal Bayesian network to predict cause probabilities that lead to customer churn.
  arXiv  Detail & Related papers  (2023-04-20T18:56:13Z)
• Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model [50.06663781566795]
  We consider a dynamic model with the consumers' preferences as well as price sensitivity varying over time. We measure the performance of a dynamic pricing policy via regret, which is the expected revenue loss compared to a clairvoyant that knows the sequence of model parameters in advance. Our regret analysis results not only demonstrate optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information.
  arXiv  Detail & Related papers  (2023-03-28T00:23:23Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Approaching sales forecasting using recurrent neural networks and transformers [57.43518732385863]
  We develop three alternatives to tackle the problem of forecasting the customer sales at day/store/item level using deep learning techniques. Our empirical results show how good performance can be achieved by using a simple sequence to sequence architecture with minimal data preprocessing effort. The proposed solution achieves a RMSLE of around 0.54, which is competitive with other more specific solutions to the problem proposed in the Kaggle competition.
  arXiv  Detail & Related papers  (2022-04-16T12:03:52Z)
• Loss Functions for Discrete Contextual Pricing with Observational Data [8.661128420558349]
  We study a pricing setting where each customer is offered a contextualized price based on customer and/or product features. We observe whether each customer purchased a product at the price prescribed rather than the customer's true valuation.
  arXiv  Detail & Related papers  (2021-11-18T20:12:57Z)
• Model Distillation for Revenue Optimization: Interpretable Personalized Pricing [8.07517029746865]
  We present a customized, prescriptive tree-based algorithm that distills knowledge from a complex black-box machine learning algorithm. It segments customers with similar valuations and prescribes prices in such a way that maximizes revenue while maintaining interpretability.
  arXiv  Detail & Related papers  (2020-07-03T18:33:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.