EconBase
← Back to paper

Negotiating Networks in Oligopoly Markets for Price-Sensitive Products

Extracted main text — title through conclusion, appendix excluded. This is what our citation measures are computed over, published so the extraction can be checked by eye.

21,202 characters · 12 sections · 34 citation commands

Rendered from LaTeX for readability, not typeset faithfully. Citation keys are highlighted; maths is left as source; figures, tables and equation environments are summarised rather than reproduced; unrecognised commands are greyed out so nothing is silently dropped. Email addresses are removed.

Negotiating Networks in Oligopoly Markets for Price-Sensitive Products

abstractWe present a novel framework to learn functions that estimate decisions of sellers and buyers simultaneously in a 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 maximised 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.

Introduction

Markets dominated by a small number of sellers, none of which can keep others from having significant influence, are known as oligopoly markets shubik1959strategy. In such markets, the prices of the offered services and products are usually set by the sellers, and buyers can only influence overall demand. Due to this, demand plays an important role in price determination and vice-versa. Revenue management has been instrumental for price determination in markets like hospitality, airlines, financial services, medical services, and the telecommunications industry talluri2004theory, boyd2003revenue. Generally, prices are determined using demand forecasting daganzo2014multinomial and estimating utility functions kim2002modeling within these systems. Recently, it has been demonstrated that demand forecasting models based on deep neural networks outperformed traditional statistical techniques law2000back. Also, discrete choice models trained using machine learning methods have proven to perform significantly better than conventional alternatives west1997comparative, imai2009bayesian. Despite their respective advancements, there exist no framework which could leverage the potential of real-world market interactions between sellers and buyers. Furthermore, most of the pricing models are sequentially coupled with demand forecasting techniques which makes implementing real-world market negotiations even challenging.

In this work, we present a novel framework to simulate oligopoly marketplace interactions. Using this setting, one can (a) learn two disentangled estimator functions representing seller and buyer actions respectively, (b) determine better optimal contextual prices and their corresponding demand, (c) explore new stable and unstable equilibrium prices, and (d) perform choice modeling with respect to context and price.

Related work

Topics in dynamic pricing of homogeneous products have been extensively studied den2015dynamic. In fact, dynamic pricing has been a catalyst for innovation in various transport and service industries. Ride-hailing platforms have used surge pricing to match demand and supply, and to avoid the "wild-goose chase" problem castillo2017surge. Customer characteristics and the seller's ability to price discriminate are also shown to significantly influence overall revenue and profit varian1989price. It has been demonstrated that dynamic pricing using buyers' context can achieve higher conversion rates as well as revenue per offer by the sellers ye2018customized, shukla_dynamic_2019. As far as buyer behaviour modeling is concerned, multiple theoretical models KahnemanTversky,GabaixLaibson,ShulmanGeng based on risk perception, knowledge levels and bounded rationality; and discrete choice models BenAkiva are typically used. Recently, it has been shown that buyer models based on pointer networks, first introduced by vinyals2015pointer, offers a promising alternative for choice modeling mottini2017deep.

Deep neural networks have demonstrated tremendous success in decision making across mass-impact domains, such as finance nelson_stock_example, pricing chiarazzo2014neural, ye2018customized and policy-making hochtl2016big. Among others, generative adversarial networks goodfellow2014generative have emerged as powerful frameworks across multiple fields of application. For instance, some of the state-of-the-art models in computer vision for image segmentation chen2018semantic, image-to-image translation isola2017image, zhu2017unpaired, liu2017unsupervised, data augmentation bousmalis2017unsupervised and classification tasks aggarwal2021generative are based on generative adversarial nets. We derive inspiration from the generative adversarial framework, where two models compete with each other and thereby learn from each other. Similarly, models negotiate with each other (as they do in real market) and find the optimal price using a negotiating networks framework.

NegoNets: Negotiating Networks

Consider the general setting of an oligopoly marketplace where buyers and sellers interact. A set of $n$ such interactions is represented by \{($x_i, p_i, y_i$)\}, $i = 1, \dots, N$. Here, $\{x_i\}_{i=1}^N$ where $x_i \in \mathbb{R}^\mathcal{D}$ represent contextual information; $\{p_i\}_{i=1}^N$ where $p_i \in [0, 1]$ represents scaled offered price ($0$ and $1$ for minimum and maximum allowed prices respectively); and finally, the buyer's decision as probability of purchase is represented by $\{y_i\}_{i=1}^N$, where $y_i \in \{0, 1\}$. The objective of the method presented below is to determine two estimator functions $f_s$ and $f_b$ which approximate the seller's and buyer's decisions respectively. The seller suggests a price $f_s(x)$ for a context $x$ and the buyer takes this context along with the suggested price to assign a probability distribution , $f_b(x, f_s(x))$, over purchase or no-purchase options.

Adversarial loss

To incorporate the negotiation between two networks, we apply adversarial loss to both estimator functions. For function $f_s$ : $\mathbb{R}^\mathcal{D} \rightarrow [0, 1]$ and $f_b$ : $\mathbb{R}^{\mathcal{D}+1} \rightarrow [0,1]$, we express the objective as:

equation[equation omitted — 243 chars of source]

where, $f_s$ tries to maximize the incremental expected revenue and $f_b$ aims to minimize the point wise loss gupta_how_2019. The incremental expected revenue part of the loss function is responsible for making the seller push for higher prices in cases where the expectation of conversion is high. Whereas, point wise loss creates a shape constraint in the buyer network. Price sensitivity is induced using this shape constraint, which is responsible for penalizing negative correlated decisions from buyers network to recommended price. In other words, price sensitivity makes the buyer rational and stops the network from being compliant with higher prices.

Independent loss

Unlike adversarial loss, we introduce loss functions that are mutually independent. The independent loss function is expressed as:

equation[equation omitted — 202 chars of source]

In equation ((ref)), the first part is cross entropy loss for the buyer network and the second part is boundary loss, which is applied to the seller network. In equation ((ref)), $\mathcal{B}$ represents the boundary function. This function is inspired from strategic model proposed by ye2018customized and $\epsilon$-insensitive loss used in SVR smola2004tutorial. The enhanced version of this function heuristically incorporates the monotonicity in the willingness to pay as mentioned in shukla_dynamic_2019. The boundary function penalizes the networks for violating upper and lower bounds as follows:

equation[equation omitted — 127 chars of source]
equation[equation omitted — 61 chars of source]
equation[equation omitted — 60 chars of source]

For all instances involving a purchase, the lower bound $L$ is the purchase price $p$. Otherwise, a lower price $c_1p$ is set to be the lower bound, where $c_1 \in (0,1)$. Similarly, the upper bound $U$ is $p$ for all the instances of no purchase. If there is a purchase, a price of $c_2p$ ($c_2>1$) is set as the upper bound. For the boundary loss to be non-zero, $c_2 > \frac{fs}{p}$ and $\frac{fs}{p} < c_1 < 1$. For $c_1 = c_2 = 1$, the lower bound and upper bound are equal and hence the trivial optimal price will be $p$. Therefore, $c_1$ and $c_2$ are hyperparameters that can be calibrated to change the gap between the lower and upper bounds.

Overall objective

figure[figure omitted — 374 chars of source]

The overall objective that we aim to solve is:

equation[equation omitted — 139 chars of source]

where, $\lambda$ controls the relative importance of the two components. In practice, $\lambda$ can be calibrated to get desired amount of negotiation between the two network. For visual intuitions, the contour plots for each component of the loss function are presented in Fig (ref). Expected revenue contour spans hyperbolic lines in price and probability of purchase space. Whereas, the point-wise loss, present in the first and the third quadrants of delta space (change in price and change in probability), represents price sensitivity. Finally, boundary function contour plots shows configurable optimal region in offered and suggested price space.

Experiments

In this section, we present empirical results for the proposed negotiating network framework as market place interaction. In addition to quantitative comparison, we perform post-hoc analysis of the method to gauge which configuration gives most realistic results. In the following experiments, we focused on one industrial application which could provide both simulated and real-world oligopoly market interactions. We aim to extend this analysis to other industries and markets to study the applicability in future research.

Demand forecasting is frequently used for price determination in price sensitive markets. Therefore, we use the buyer's baseline as estimated probability of an individual interaction converting to purchase, which, when aggregated over the population, is a proxy for estimated demand. Then, logistic regression is used for the given estimated demand to decide the selling price as the seller's baseline avlonitis2005pricing. These baselines are then compared with proposed framework.

Across all experiments, we use 4-layer deep neural network for the buyer, the seller, and the baseline demand forecasting model. Adam adam_kingma optimizer is used with an early stopping criterion. We tune hyperparameters such as optimizer and learning rate, and keep them same for other networks to facilitate a fair comparison. Some method specific parameters like $c1$, $c2$ and $\lambda$ are set to be $0.5$, $2$ and $1$, respectively.

Evaluation Metrics

In this section, we define the metrics that are used for evaluating performance of the seller and the buyer models. We use F1 score to evaluate classification accuracy, and monotonicity score $\mathcal{M}_k$ gupta_how_2019, wilmott1995mathematics, gupta2021pender to measure diminishing returns (decreasing and convex shape) with respect to price increase for buyer model, as per utility theory. Here, price $p$ is the target feature $k$. For seller models, we use the following custom metrics introduced by ye2018customized and frequently used in applied revenue management kolbeinsson2021galactic to gauge the goodness of price:

Price Decrease F1 (PDF1). This metric is inspired by the F1 score used to evaluate the precision and recall tradeoff. PDF1 therefore measures the tradeoff between Price Decrease Recall (PDR) and \textit{Price Decrease Precision} (\texttt{PDP}) according to equation ((ref)). \texttt{PDR} measures how likely the suggested prices are lower than the actual offered prices for non-purchased interactions and \texttt{PDP} measures the percentage of non purchased interactions where the suggested price is lower than actual price.

equation[equation omitted — 121 chars of source]

Price Increase F1 (PIF1). Similar to PDF1, this score uses Price Increase Recall (PIR) and Price Increase Precision (\texttt{PIP}) based on equation ((ref)). \texttt{PIR} measures how likely the suggested prices are higher than actual offered prices for purchased interactions and \texttt{PIP} measures the percentage of purchased interactions where the suggested price is higher than actual price.

equation[equation omitted — 121 chars of source]

Regret Score (RS). Defined by equation ((ref)), RS measures the central tendency of the missed opportunity to suggest the price greater or equal to actual offered price in all purchased interactions.

equation[equation omitted — 122 chars of source]

Datasets

Ancillaries are optional products or services sold by businesses to complement their primary product bockelie2017incorporating. In this work, we have utilized the following datasets from the airline industry for an ancillary market: (1) simulated interaction of flight seat (as ancillary) pricing using open-sourced flai simulator\footnote{https://github.com/deepair-io/flai}, and (2) real-world proprietary interactions for ancillaries from a large airline containing price variability.

Simulator dataset

This dataset consists of simulated interactions for selecting flight seat after the ticket is purchased for a one-way flight. Customer arrivals are simulated using non-homogeneous poisson process lewis1979simulation. Multinomial logit is used for customer choice model in the simulator hausman1984specification. Offered prices for seat selection are randomly sampled from minimum to maximum allowed price for that flight. We have simulated 8 long-distance flights with high value of allowed prices for training, and 2 short-distance flights with low value of allowed prices.

table[table omitted — 677 chars of source]

According to Table (ref), superior performance of buyer network trained using NegoNets as compared to baseline indicates that the network learns a generalised representation, which can account for change in test distribution i.e. from relatively less price sensitive interactions (higher allowed price value) to more price sensitive ones (lower allowed price value). While both NegoNets and baseline have similar RS, the seller model trained from NegoNets outperforms in PIF1. This implies that the seller network is able to increment prices for correctly identified purchased sessions. Whereas PDF1 is slightly higher for baseline because estimated forecast is highly biased towards non purchased interactions, resulting in overall low suggested prices.

Real-world dataset

Dynamic pricing of ancillary products and services is a recently adopted application in airline industry. We have used a proprietary real-world dataset for ancillary pricing from a large airline. This dataset contains transactions with offered prices varying from minimum value (normalized to 0) to maximum value (normalized to 1) for one of the ancillary services offered by the airline. Unlike simulations, there are 10 different origin-destination pairs with 680 unique flights in this dataset. We use 20% of the dataset for testing, and perform a 80-20 split on the remaining data to create train and validation sets. It is worth emphasising that this dataset is inherently non-monotonic, i.e. as price increase the purchase ratio does not decrease.

table[table omitted — 726 chars of source]

Interestingly, the seller network trained with NegoNets reached higher F1 score with lower $\mathcal{M}$ as compared to baseline as shown in Table (ref). Since, the dataset is inherently non-monotonous and the shape constraints are not enforced explicitly but learned from the data, the higher F1 score is justified. In other words, learning the diminishing returns criteria could guide the network to attain higher local optima as compared to its exclusion. For seller models, both PDF1 and PIF1 scores are comparable. Yet, NegoNet seller is able to reach better RS as compared to its baseline. Reason being the baseline method optimizes price given the purchase probability, and the proposed method estimates the price distribution directly.

Discussion

We show, for the first time, that oligopoly market interactions can be framed as negotiating networks. The experiments on airline ancillary simulation and on real-world dataset successfully demonstrates that learning disentangled networks (seller and buyer network) can achieve better individual performance as compared to sequential forecasting and optimization conventional technique. Besides this, we have shown that using negotiating networks framework, one can explore new ranges of potential prices along with their estimated demand to come up with novel policies and market equilibrium states.

We have presented the results from our first attempt to model market interactions, and there is much room for improvement. In practice, the proposed framework is sensitive to model parameters. Since GAN-based networks are prone to mode collapse, such framework configuration becomes even critical. Hence, sustaining equilibrium state in such settings is still an open question. In this framework, we have not included other confounding factors like cost of the product, inventory management, and competitor's influence on both sellers and buyers. Furthermore, contextual information conditioned on the network has not been explored yet. We plan to extend our empirical evaluation to other applied fields. We are specifically interested in further examining the attained pricing equilibrium with theoretical guarantees. Given that negotiations can be achieved based on price, it will help our understanding of whether other attributes similar to price make interaction more efficient or not.