Negotiating Networks in Oligopoly Markets for Price-Sensitive Products

• URL: http://arxiv.org/abs/2110.13303v1
• Date: Mon, 25 Oct 2021 22:29:48 GMT
• Title: Negotiating Networks in Oligopoly Markets for Price-Sensitive Products
• Authors: Naman Shukla and Kartik Yellepeddi
• Abstract summary: We present a novel framework to learn functions that estimate decisions of sellers and buyers simultaneously in an oligopoly market for a price-sensitive product. Similar to generative adversarial networks, this framework corresponds to a minimax two-player game.
• Score: 2.4366811507669124
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a novel framework to learn functions that estimate decisions of sellers and buyers simultaneously in an oligopoly market for a price-sensitive product. In this setting, the aim of the seller network is to come up with a price for a given context such that the expected revenue is maximized by considering the buyer's satisfaction as well. On the other hand, the aim of the buyer network is to assign probability of purchase to the offered price to mimic the real world buyers' responses while also showing price sensitivity through its action. In other words, rejecting the unnecessarily high priced products. Similar to generative adversarial networks, this framework corresponds to a minimax two-player game. In our experiments with simulated and real-world transaction data, we compared our framework with the baseline model and demonstrated its potential through proposed evaluation metrics.

Related papers

• By Fair Means or Foul: Quantifying Collusion in a Market Simulation with Deep Reinforcement Learning [1.5249435285717095]
  This research employs an experimental oligopoly model of repeated price competition. We investigate the strategies and emerging pricing patterns developed by the agents, which may lead to a collusive outcome. Our findings indicate that RL-based AI agents converge to a collusive state characterized by the charging of supracompetitive prices.
  arXiv  Detail & Related papers  (2024-06-04T15:35:08Z)
• A Network Simulation of OTC Markets with Multiple Agents [3.8944986367855963]
  We present a novel approach to simulating an over-the-counter (OTC) financial market in which trades are intermediated solely by market makers. We show that our network-based model can lend insights into the effect of market-structure on price-action.
  arXiv  Detail & Related papers  (2024-05-03T20:45:00Z)
• Dynamic pricing with Bayesian updates from online reviews [0.15020330976600735]
  We consider a pricing model with online reviews in which the quality of the product is uncertain. We compare the optimal static and dynamic pricing strategies in terms of the probability of effectively learning the quality of the product.
  arXiv  Detail & Related papers  (2024-04-23T11:55:20Z)
• An Auction-based Marketplace for Model Trading in Federated Learning [54.79736037670377]
  Federated learning (FL) is increasingly recognized for its efficacy in training models using locally distributed data. We frame FL as a marketplace of models, where clients act as both buyers and sellers. We propose an auction-based solution to ensure proper pricing based on performance gain.
  arXiv  Detail & Related papers  (2024-02-02T07:25:53Z)
• Contextual Dynamic Pricing with Strategic Buyers [93.97401997137564]
  We study the contextual dynamic pricing problem with strategic buyers. Seller does not observe the buyer's true feature, but a manipulated feature according to buyers' strategic behavior. We propose a strategic dynamic pricing policy that incorporates the buyers' strategic behavior into the online learning to maximize the seller's cumulative revenue.
  arXiv  Detail & Related papers  (2023-07-08T23:06:42Z)
• 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)
• Robustness Certificates for Implicit Neural Networks: A Mixed Monotone Contractive Approach [60.67748036747221]
  Implicit neural networks offer competitive performance and reduced memory consumption. They can remain brittle with respect to input adversarial perturbations. This paper proposes a theoretical and computational framework for robustness verification of implicit neural networks.
  arXiv  Detail & Related papers  (2021-12-10T03:08:55Z)
• Dynamic Pricing and Demand Learning on a Large Network of Products: A PAC-Bayesian Approach [8.927163098772589]
  We consider a seller offering a network of $N$ products over a time horizon of $T$ periods. The seller does not know the parameters of the products' linear demand model. We propose a dynamic pricing-and-learning policy that combines the optimism-in-the-face-of-uncertainty and PAC-Bayesian.
  arXiv  Detail & Related papers  (2021-11-01T09:37:36Z)
• Multiple Dynamic Pricing for Demand Response with Adaptive Clustering-based Customer Segmentation in Smart Grids [9.125875181760625]
  We propose a realistic multiple dynamic pricing approach to demand response in the retail market. The proposed framework is evaluated via simulations based on real-world datasets.
  arXiv  Detail & Related papers  (2021-06-10T16:47:15Z)
• Fairness, Welfare, and Equity in Personalized Pricing [88.9134799076718]
  We study the interplay of fairness, welfare, and equity considerations in personalized pricing based on customer features. We show the potential benefits of personalized pricing in two settings: pricing subsidies for an elective vaccine, and the effects of personalized interest rates on downstream outcomes in microcredit.
  arXiv  Detail & Related papers  (2020-12-21T01:01:56Z)
• MoTiAC: Multi-Objective Actor-Critics for Real-Time Bidding [47.555870679348416]
  We propose a Multi-ecTive Actor-Critics algorithm named MoTiAC for the problem of bidding optimization with various goals. Unlike previous RL models, the proposed MoTiAC can simultaneously fulfill multi-objective tasks in complicated bidding environments.
  arXiv  Detail & Related papers  (2020-02-18T07:16:39Z)

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.