<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Recommendations for Long-Term Profit Optimization</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Patrick Hosein, Inzamam Rahaman, Keanu Nichols, Kiran Maharaj The University of the West Indies</institution>
          ,
          <addr-line>St. Augustine</addr-line>
          ,
          <country country="TT">Trinidad and Tobago</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Recommender Systems</institution>
          ,
          <addr-line>Profit Optimization, Long-Term Profit, Naive Bayes</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <fpage>16</fpage>
      <lpage>20</lpage>
      <abstract>
        <p>Recommender Systems have traditionally sought to identify the most relevant products for a customer with the aim of maximizing expected purchases. While this may be an appropriate objective for services such as Netflix and Spotify, it may not necessarily be so for others. For example, an insurance firm may want to recommend the most suitable insurance plan to a customer but it may also want to take into account the profitability of the product being recommended. This, however, is a delicate trade-of since if the ofered product is not suficiently suitable then the customer may switch to a competitor. Therefore, the product should be suficiently likable to keep the customer while also being suficiently profitable. We consider this problem and introduce a recommender system that picks the products that maximize the long-term profit for the company. In this way the company benefits, by having acceptable profits from a long-term customer, while the customer benefits by receiving satisfactory recommendations. The long-term profit is the sum of the immediate profit (i.e., for the immediately recommended product) and the expected profit of future product purchases made by the customer.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 INTRODUCTION</title>
      <p>In a Recommender System, one uses historical customer
information to determine a suitable product to recommend to a
present or new customer. Such determinations are typically
made based on the users’ past interactions and the
underlying characteristics associated with the user and the domain’s
items. Recommender systems are primarily modelled on user
preferences and are developed as a personalized service made
available on major e-commerce and leisure websites such as
Amazon, Netflix, Spotify, Pandora and YouTube.</p>
      <p>Research into Recommender Systems has traditionally
been user-focused with the emphasis being on the
maximization of the predictive accuracy of the recommender system.
While it is important to maximize the utility of the system
Copyright ©2019 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
for the user, perhaps of equal importance should be the
utility or business value to the company providing the product.
The development of a recommender system is typically
motivated by the assumption that assisting users in finding
more relevant products would lead to future purchases from
the vendor. However, there is merit in including the
profitability of items within the recommendation process itself
[2, 3, 7, 13, 19].</p>
      <p>In traditional Recommender Systems, a company
recommends a product or service with the highest probability of
being accepted by the customer. However, if the chosen
product is not profitable then it may not be in the company’s best
interest to ofer it. On the other hand one can recommend the
product with the highest profitability but such an item may
be unlikely to be purchased by the customer and hence the
sale is lost. A third option is to choose the product with the
highest expected profitability, i.e., the product for which the
probability that the customer chooses the product times the
profit associated with the product is the largest. Although
this approach maximizes the immediate expected profit, this
choice may not maximize the long term profits possible from
the customer [1, 13]. In this paper we instead maximize the
long-term profit which takes into account the short-term
profit as well as the long term retention (and hence
continued profits) of the customer. Such a model has not been
widely studied in the literature but we believe that it most
appropriately represents the objective of the company while
at the same time providing benefits to the customer.
2</p>
    </sec>
    <sec id="sec-2">
      <title>RELATED WORK AND CONTRIBUTIONS</title>
      <p>The work in [4] addresses the profit maximization problem
but uses a diferent approach. They attempt to maximize
the sum of the prices of the recommended products. They
then define a trust factor which represents the diference
between the profit-based recommendations and those that
would have been made if chosen independently of profit.
The optimization problem includes a constraint with a lower
bound on the trust. In other words, only products that are
relatively close to those that are highly probable to be chosen
by the customer (and hence maintains the customer’s trust)
are chosen. In our case we take into account the trust factor
by including it directly into the objective function of the
proposed model.</p>
      <p>Similarly, the paper [12] considers other objectives in
addition to profit maximization. In addition to the most likely
item to recommend, one may want to consider whether the
item is in stock. Also, the user may already be familiar with
popular items and hence it might be more beneficial to
recommend a less popular item that they may like. The latter
case is addressed by assigning weights to rankings and
reordering. The former is addressed by using thresholds as
was done in [4]. However these require the specification of
weights which may have to be constantly adjusted.</p>
      <p>The paper by Jannach et. al. [13] summarizes the
various approaches described above, but it also brings up the
issue of long-term revenue, although it is not directly
addressed. Their conclusion was that the incorporation of the
long term perspective has been largely under-explored and
hence we believe that our proposed model is new. The paper
by Hosanagar et. al. [10] also addresses revenue
optimization but only the short-term revenue optimization case.
Additional research, but similar to the above, can be found in
[2, 5, 7, 8, 14, 15, 17, 18, 20–22].</p>
      <p>Our contributions include, (a) a model for optimizing
longterm revenue when making recommendations, (b) a simple
illustrative example to show the benefits that can be gained,
(c) a more realistic example to illustrate the potential gains of
looking at the long term rather than short term profits. Note
that the underlying premise is that, typically, high demand
items (e.g. those that are inexpensive or placed on sale) tend
to have low profitability.</p>
    </sec>
    <sec id="sec-3">
      <title>3 PROBLEM FORMULATION</title>
      <p>We consider recommendations of a set of products to a set
of customers using collaborative filtering. In other words,
the recommendation made to a customer is based on the
products chosen by other customers with similar features or
purchasing habits. Prior work considered either maximizing
the probability that the recommended product is chosen (i.e.,
accuracy) or maximizing the profit achieved by the company.
Note that these objectives can conflict.</p>
      <p>In this paper we provide a diferent formulation that
captures both aspects of accuracy and profit by considering the
long-term profit that can be achieved from a customer. Let
us assume that a customer is to be provided with a sequence
of product recommendations over time. We assume that the
set of available products is continuously updated and hence
a suitable product is always available for each customer. At
each ofering of a product, the customer can either purchase
the product (and the company achieves the associated profit
or reward) or ignore the product. Furthermore, if the product
is not a suitable recommendation for the customer then the
customer may decide to stop making purchases from this
company because of a loss of trust in their recommendations,
i.e., the customer believes that the company is not making its
best ofers but rather trying to push its profitable products.</p>
      <p>We assume that K products are available and we index
these by k. Let Rk denote the reward or profit that the
company receives if the customer is ofered the product and it is
purchased. Let pk denote the probability that the customer
purchases the product if recommended. For example, one
can use techniques such as Naive Bayes to determine this
probability. Therefore, the expected profit (reward) for
product k is pk Rk . One can then find the product for which this is
maximum if the intent is to maximize revenue only for this
purchase. Let qk denote the probability that the customer
rejects the product if ofered and also stops using the
company (loss of trust). We assume that a product is ofered at
most once to a customer. Hence, when a product is
recommended, it is removed from the set of available products and
a new product (taken from the same distributions for pk , Rk
and qk ) is added to the list of products. We assume that we
are in steady state so that the products before and after a
recommendation have the same statistical properties.</p>
      <p>Let R¯ denote the expected long term reward for the
concerned customer and let R denote the maximum expected
total reward given the present recommendation (i.e, the
maximum over products of the expected value of the sum of
the present purchase reward plus the expected future
rewards). Note that future rewards are zero if the customer is
not retained. We can therefore write:</p>
      <p>R = max pk Rk + (1 − qk )R¯</p>
      <p>k
Note that we do not know the value of R¯. However, assuming
stationarity, in steady state the expected value of R will be R¯.
Assuming the variation of R from one recommendation to
the next is small we make the approximation R ≈ R¯. Using
this approximation we can now solve for R¯</p>
      <p>R¯ = max pk Rk + (1 − qk )R¯</p>
      <p>k
Subtracting R¯ from both sides we have
which can be re-written as
Consider the following equation
Note that this can be solved to obtain
max pk Rk − qk R¯ = 0</p>
      <p>k
= pk∗Rk∗
qk∗</p>
      <p>
        Lemma 3.1. The values R¯∗ and k∗ defined in (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) are also
solutions to the original optimization problem stated in (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ).
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
      </p>
      <p>This probability will have a positive relationship with 1 − p
so we assume a linear relationship such that</p>
      <p>q = ε(1 − p)
where ε &lt; 1 determines the degree by which the customer is
afected by the recommendation. We are presently
investigating other models for this relationship, such as proportional
hazard models [11], on which we will report at a later date.
We next compute the optimal values for various optimization
objectives.</p>
    </sec>
    <sec id="sec-4">
      <title>Maximum Long-Term Profit</title>
      <p>Substituting for Rk and qk in 6 we have</p>
      <p>
        R¯ = max
k
pk (1 − pk − θ )
ε(1 − pk )
Proof. We prove by contradiction. Note that
If the first two expressions are equal then k∗ and R¯∗ are also
optimal for (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) and we are done. Suppose that we have strict
inequality then this means
If we denote the optimal solution values by k ′ then for (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) to
be true we must have
where the equality is a result of (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ). This is a contradiction
and hence strict inequality cannot hold. □
4
      </p>
    </sec>
    <sec id="sec-5">
      <title>AN ILLUSTRATIVE EXAMPLE</title>
      <p>Let us illustrate the approach via a simple example. Note
that the profit of a product will typically be related to its
desirability. If this relationship is positive and profit increases
with demand (or desirability) then the optimal strategy is to
recommend the most desirable product since that strategy
will optimize accuracy as well as profit and, in turn,
longterm profit. However, in practice, the relationship between
profit and desirability tends to be a negative one. Items which
have low profitability (e.g, they are on sale) typically are
highly desired (and hence if recommended the product will
be purchased with high probability). Those products with
high profitability are less desirable since consumers may
decide to wait for a price reduction.</p>
      <p>
        For illustration purposes, let us assume that the profit of a
product decreases with increasing probability of purchase.
This is an agreement with the traditional linear demand
curve used in economics whereby price (revenue) decreases
linearly with demand (acceptance probability) [6]. Hence
R = 1 − p − θ
(
        <xref ref-type="bibr" rid="ref10">10</xref>
        )
where θ &gt; 0, to account for the case of negative revenue and
θ &lt;&lt; 1 since the company is not expected to support large
losses. This includes the case whereby a company provides
the product at a loss (e.g., to gain more customers) since we
can have R &lt; 0. This is sometimes termed a “loss leader"and
such products will be in very high demand. Vendors may
sell a small number of items at a loss in order to attract
customers in the hope that the attracted customers would also
purchase items with higher profitability [ 9]. The relationship
in equation 10, which is based on the assumption that low
profit items tend to be in higher demand, is our initial guess
and more work is needed for a more precise model.
      </p>
      <p>Next let us consider q which is the probability that a
customer leaves because of inappropriate recommendations.
For this illustrative example let us assume a continuous
function of pk (i.e., for any pk , we can find a corresponding
product) we can then obtain the maximum by taking derivatives.
Let us define</p>
      <p>F (pk ) =
pk (1 − pk − θ )
(1 − pk )
where F is the function giving the long term profit from
selecting a product with a particular purchase probability.
Note that
and hence a single maximum exists.</p>
      <p>F ′′(pk ) = −2θ (1 − pk )−3 &lt; 0</p>
      <p>F ′(pk ) = 1 − θ (1 − pk )−2
and setting to zero and solving for pk∗ we obtain
pk∗ = 1 −
√</p>
      <p>θ
¯
RLT =</p>
      <p>
        √
1 + θ − 2 θ
ε
(
        <xref ref-type="bibr" rid="ref11">11</xref>
        )
(
        <xref ref-type="bibr" rid="ref12">12</xref>
        )
(
        <xref ref-type="bibr" rid="ref13">13</xref>
        )
(
        <xref ref-type="bibr" rid="ref14">14</xref>
        )
(
        <xref ref-type="bibr" rid="ref15">15</xref>
        )
(
        <xref ref-type="bibr" rid="ref16">16</xref>
        )
(
        <xref ref-type="bibr" rid="ref17">17</xref>
        )
(
        <xref ref-type="bibr" rid="ref18">18</xref>
        )
(
        <xref ref-type="bibr" rid="ref19">19</xref>
        )
where k∗ is the product that achieves this optimal point.
Finally we obtain
where R¯LT is the expected long term profit obtained by
explicitly maximizing the long term profit.
      </p>
    </sec>
    <sec id="sec-6">
      <title>Maximizing Short-Term Profit</title>
      <p>In the case of maximizing short term profit we instead have</p>
      <p>F (pk ) = pk (1 − pk − θ )
where F is the function giving the short term profit from
selecting a product with a particular purchase probability.
We can again show a single maximum and that this occurs
when
pk∗ =
We are interested in the long term profit (for this short term
optimization problem) and this is given by
¯
RST =
pk∗ (1 − pk∗ − θ ) = (1 − θ )</p>
      <p>ε(1 − pk∗ ) 2ε</p>
    </sec>
    <sec id="sec-7">
      <title>Maximizing Accuracy</title>
      <p>In this case we have</p>
      <p>F (pk ) = pk</p>
      <p>pk∗ = 1
where F is the accuracy of selecting a product with a
particular purchase probability. The optimal solution is
and so the long term profit in this case is given by
R¯AC = lim
pk∗ →1
pk∗ (1 − pk∗ − θ ) = −∞</p>
      <p>ε(1 − pk∗ )</p>
    </sec>
    <sec id="sec-8">
      <title>Comparison</title>
      <p>Clearly maximizing accuracy is not appropriate since the
customer is retained forever but for each product sold the
company loses money (i.e., the loss leader approach is not
valid in this case). The ratio of the long term profit to the
short-term profit can be written as
ρ ≡ RR¯¯SLTT = 2(1 − √θ ) .</p>
      <p>(1 + √θ )
In Figure 1 we plot this ratio as a function of the parameter θ
for small values. Note that θ will typically be small since this
represents the loss the company is willing to incur for the
"loss leader" item. For such values optimizing for long term
instead of short term profit results in an almost doubling of
the expected profit. Note that this ratio is independent of the
factor ε which determines how likely a customer will leave
the vendor if recommended products are not suitable.
(24)
ρ</p>
      <p>2
1.8
1.6
1.4
1.2
1
0
0.02
0.04
0.06
0.08</p>
      <p>0.1
θ</p>
    </sec>
    <sec id="sec-9">
      <title>5 NUMERICAL RESULTS</title>
      <p>
        We used the MovieLens dataset that comprises 100,000
ratings (
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1-5</xref>
        ) (bad-excellent) from 943 users on 1682 movies.
From this dataset 563 users were used for training for a
Naive Bayes model which was imported from sklearn. If a
user assigned a rating of 4 or 5 to a movie, we took this to
indicate that a user liked a movie. Using sex, age, and
occupation as the user attributes, we then used Naive Bayes to
learn the probability of a user liking a particular movie.
      </p>
      <p>
        According to a CNN article [16], “The percentage of ticket
sales that the studio takes decreases on each week that a
movie is in the theater" and so we assume a similar profit
model (for the vendor) with profit linearly increasing with
age. More precisely, if tm is the age of movie m in years, rm ,
the profit of movie m, was taken to be rm = 2 + 0.75tm + η,
where η ∼ N (
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ).
      </p>
      <p>The results obtained are provided in Table 1 where the
objectives (maximizing accuracy, short-term profit and long
-term profit) are listed in the columns and the evaluation
criteria are listed in the rows. As expected, the optimal metric
value corresponds to the associated objective function.
However the distinction is not as clear as expected. We believe
the reason to be the fact that the collaborative filtering of the
MovieLens dataset results in older rather than newer movies
being highly recommended.</p>
    </sec>
    <sec id="sec-10">
      <title>6 CONCLUSIONS AND FUTURE WORK</title>
      <p>We developed a model for optimizing long-term revenue in a
recommender system. We then formulated and solved the
associated optimization problem and illustrated the approach
with the MovieLens dataset. Although we did find a
distinction, we believe that a more appropriate dataset that includes
pricing information and is less skewed would provide more
insightful results. We are presently in the process of
identifying such a dataset and will provide results in a future
paper. We also plan to investigate customer retention models
which is the probability of customer loss as a function of the
suitability of the product ofered to them.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Gediminas</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          , Jesse C. Bockstedt,
          <string-name>
            <given-names>Shawn P.</given-names>
            <surname>Curley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Jingjing</given-names>
            <surname>Zhang</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Efects of Online Recommendations on Consumers' Willingness to Pay</article-title>
          .
          <source>Info. Sys. Research 29, 1 (March</source>
          <year>2018</year>
          ). https://doi.org/10.1287/isre.
          <year>2017</year>
          .0703
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Amos</given-names>
            <surname>Azaria</surname>
          </string-name>
          , Avinatan Hassidim, Sarit Kraus, Adi Eshkol, Ofer Weintraub, and
          <string-name>
            <given-names>Irit</given-names>
            <surname>Netanely</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Movie Recommender System for Profit Maximization</article-title>
          .
          <source>In Proceedings of the 7th ACM Conference on Recommender Systems (RecSys '13)</source>
          . ACM, New York, NY, USA,
          <fpage>121</fpage>
          -
          <lpage>128</lpage>
          . https://doi.org/10.1145/2507157.2507162
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Long-Sheng</surname>
            <given-names>Chen</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fei-Hao</surname>
            <given-names>Hsu</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mu-Chen Chen</surname>
          </string-name>
          , and
          <string-name>
            <surname>Yuan-Chia Hsu</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Developing recommender systems with the consideration of product profitability for sellers</article-title>
          .
          <source>Information Sciences 178</source>
          ,
          <issue>4</issue>
          (
          <year>2008</year>
          ),
          <fpage>1032</fpage>
          -
          <lpage>1048</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Aparna</given-names>
            <surname>Das</surname>
          </string-name>
          ,
          <string-name>
            <surname>Claire Mathieu</surname>
            , and
            <given-names>Daniel</given-names>
          </string-name>
          <string-name>
            <surname>Ricketts</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Maximizing profit using recommender systems</article-title>
          .
          <source>CoRR abs/0908</source>
          .3633 (
          <year>2009</year>
          ). arXiv:
          <volume>0908</volume>
          .3633 http://arxiv.org/abs/0908.3633
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Michael</given-names>
            <surname>Fellmann</surname>
          </string-name>
          , Novica Zarvić, and Oliver Thomas.
          <year>2018</year>
          .
          <article-title>Business processes modeling recommender systems: User expectations and empirical evidence</article-title>
          .
          <source>Complex Systems Informatics and Modeling Quarterly</source>
          <volume>14</volume>
          (
          <year>2018</year>
          ),
          <fpage>64</fpage>
          -
          <lpage>79</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Friedman</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <string-name>
            <given-names>Price</given-names>
            <surname>Theory</surname>
          </string-name>
          . Taylor &amp; Francis. https://books. google.tt/books?id=SyEuDwAAQBAJ
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Michele</given-names>
            <surname>Gorgoglione</surname>
          </string-name>
          , Umberto Panniello, and
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Tuzhilin</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Recommendation strategies in personalization applications</article-title>
          .
          <source>Information &amp; Management</source>
          <volume>56</volume>
          ,
          <issue>6</issue>
          (
          <year>2019</year>
          ),
          <volume>103143</volume>
          . https://doi.org/10. 1016/j.im.
          <year>2019</year>
          .
          <volume>01</volume>
          .005
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Mikael</given-names>
            <surname>Hammar</surname>
          </string-name>
          , Robin Karlsson, and
          <string-name>
            <given-names>Bengt J.</given-names>
            <surname>Nilsson</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Using Maximum Coverage to Optimize Recommendation Systems in e-Commerce</article-title>
          .
          <source>In Proceedings of the 7th ACM Conference on Recommender Systems (RecSys '13)</source>
          . ACM, New York, NY, USA,
          <fpage>265</fpage>
          -
          <lpage>272</lpage>
          . https://doi.org/10.1145/2507157.2507169
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>James</surname>
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Hess</surname>
            and
            <given-names>Eitan</given-names>
          </string-name>
          <string-name>
            <surname>Gerstner</surname>
          </string-name>
          .
          <year>1987</year>
          .
          <article-title>Loss Leader Pricing and Rain Check Policy</article-title>
          .
          <source>Marketing Science</source>
          <volume>6</volume>
          ,
          <issue>4</issue>
          (Nov.
          <year>1987</year>
          ),
          <fpage>358</fpage>
          -
          <lpage>374</lpage>
          . https: //doi.org/10.1287/mksc.6.4.
          <fpage>358</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Kartik</surname>
            <given-names>Hosanagar</given-names>
          </string-name>
          , Ramayya Krishnan, and Liye Ma.
          <year>2008</year>
          .
          <article-title>Recomended for you: The impact of profit incentives on the relevance of online recommendations</article-title>
          .
          <source>ICIS 2008 Proceedings</source>
          (
          <year>2008</year>
          ),
          <fpage>31</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Tomoharu</surname>
            <given-names>Iwata</given-names>
          </string-name>
          , Kazumi Saito, and
          <string-name>
            <given-names>Takeshi</given-names>
            <surname>Yamada</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>Recommendation Method for Extending Subscription Periods</article-title>
          .
          <source>In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06)</source>
          . ACM, New York, NY, USA,
          <fpage>574</fpage>
          -
          <lpage>579</lpage>
          . https://doi.org/10.1145/1150402.1150470
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Tamas</given-names>
            <surname>Jambor</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jun</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Optimizing multiple objectives in collaborative filtering</article-title>
          .
          <source>In Proceedings of the fourth ACM conference on Recommender systems. ACM</source>
          , ACM, New York, NY, USA,
          <fpage>55</fpage>
          -
          <lpage>62</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Dietmar</given-names>
            <surname>Jannach</surname>
          </string-name>
          and
          <string-name>
            <given-names>Gediminas</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Price and profit awareness in recommender systems</article-title>
          .
          <source>arXiv preprint arXiv:1707.08029</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Georgia</given-names>
            <surname>Koutrika</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Modern Recommender Systems: From Computing Matrices to Thinking with Neurons</article-title>
          .
          <source>In Proceedings of the 2018 International Conference on Management of Data (SIGMOD '18)</source>
          . ACM, New York, NY, USA,
          <fpage>1651</fpage>
          -
          <lpage>1654</lpage>
          . https://doi.org/10.1145/3183713. 3197389
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Shanyun</surname>
            <given-names>Liu</given-names>
          </string-name>
          , Yunquan Dong, Pingyi Fan, Rui She, and
          <string-name>
            <given-names>Shuo</given-names>
            <surname>Wan</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Matching Users' Preference Under Target Revenue Constraints in Optimal Data Recommendation Systems</article-title>
          . ArXiv abs/
          <year>1901</year>
          .10721 (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Annelena</given-names>
            <surname>Lobb</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>How a movie theater makes a buck</article-title>
          . (
          <year>2002</year>
          ). https://money.cnn.com/
          <year>2002</year>
          /03/08/smbusiness/q_movies/
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Cheng</surname>
            <given-names>Long</given-names>
          </string-name>
          , Raymond
          <string-name>
            <surname>Chi-Wing Wong</surname>
          </string-name>
          , and Victor Junqiu Wei.
          <year>2018</year>
          .
          <article-title>Profit Maximization with Suficient Customer Satisfactions</article-title>
          .
          <source>ACM Trans. Knowl. Discov. Data</source>
          <volume>12</volume>
          ,
          <issue>2</issue>
          ,
          <string-name>
            <surname>Article 19</surname>
          </string-name>
          (
          <issue>Jan</issue>
          .
          <year>2018</year>
          ),
          <volume>34</volume>
          pages. https: //doi.org/10.1145/3110216
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Umberto</surname>
            <given-names>Panniello</given-names>
          </string-name>
          , Michele Gorgoglione, Shawndra Hill, and
          <string-name>
            <given-names>Kartik</given-names>
            <surname>Hosanagar</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Incorporating profit margins into recommender systems: A randomized field experiment of purchasing behavior and consumer trust</article-title>
          . University of Pennsylvania,
          <source>ScholarlyCommons</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>D.</given-names>
            <surname>Paraschakis</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Towards an ethical recommendation framework</article-title>
          .
          <source>In 2017 11th International Conference on Research Challenges in Information Science (RCIS)</source>
          . IEEE, US,
          <fpage>211</fpage>
          -
          <lpage>220</lpage>
          . https://doi.org/10.1109/RCIS.
          <year>2017</year>
          .7956539
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Sandeep</surname>
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Raghuwanshi</surname>
            and
            <given-names>R. K.</given-names>
          </string-name>
          <string-name>
            <surname>Pateriya</surname>
          </string-name>
          .
          <year>2019</year>
          . Recommendation Systems: Techniques, Challenges, Application, and
          <article-title>Evaluation. In Soft Computing for Problem Solving</article-title>
          , Jagdish Chand Bansal,
          <string-name>
            <surname>Kedar Nath Das</surname>
          </string-name>
          ,
          <string-name>
            <surname>Atulya Nagar</surname>
          </string-name>
          , Kusum Deep, and Akshay Kumar Ojha (Eds.). Springer Singapore, Singapore,
          <fpage>151</fpage>
          -
          <lpage>164</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Jing</surname>
            <given-names>Ren</given-names>
          </string-name>
          , Robert Kaufman, and
          <string-name>
            <given-names>Dave</given-names>
            <surname>King</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Two-Sided ValueBased Music Artist Recommendation in Streaming Music Services</article-title>
          .
          <source>In Proceedings of the 52nd Hawaii International Conference on System Sciences.</source>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Jian</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Yi</given-names>
            <surname>Zhang</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Utilizing marginal net utility for recommendation in e-commerce</article-title>
          .
          <source>In Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval. ACM</source>
          , ACM, New York, NY, USA,
          <fpage>1003</fpage>
          -
          <lpage>1012</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>