Solving a Two-Period Cooperative Advertising Problem Using Dynamic Programming

نویسندگان

  • Masoud Rabbani School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
  • Saeed Alaei Department of Industrial Engineering, Khatam University, Tehran, Iran
چکیده

Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period depends on the decisions made in the first period. The problem is solved for two cases of the absence and presence of cooperative advertising contract, and the results are compared. The solution to the problem is presented using the concepts of the Nash equilibrium, Stackelberg game, stochastic games, and dynamic programming. The computational results using numerical examples show that if the cooperative advertising contract is offered in the win-win condition, the players’ profit will increase significantly.

برای دانلود باید عضویت طلایی داشته باشید

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coordination of pricing and cooperative advertising for perishable products in a two-echelon supply chain: A bi-level programming approach

In this article the coordination of pricing and cooperative advertising decisions in one-manufacturer one-retailer decentralized supply chain with different market power for channel members is studied. The products are both perishable and substitutable. The problem is modeled as a nonlinear bi-level programming problem to consider both retailer and manufacturer decisions about prices and advert...

متن کامل

Cooperative Advertising and Pricing in a Supply Chain: A Bi-level Programming Approach

Nowadays, coordination between members in a supply chain has become very important and beneficial to channel members. Through cooperative advertising, manufacturers and retailers can jointly participate in promotional programs. This action not only reduces the cost of advertising, but also is important to create a link with local retailers in order to increase immediate sales at the retail leve...

متن کامل

Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming

We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm9block9Cmax problem using as an experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of Taillard’s instances, including the 10 instances from set 12. & 2011 Elsevier Ltd. All rights reserved.

متن کامل

Solving the flight gate assignment problem using dynamic programming

This paper considers the problem of assigning flights to airport gates—a problem which is NP-hard in general. We focus on a special case in which the maximization of flight/gate preference scores is the only objective. We show that for a variable number of flights and gates, this problem is still NP-hard. For a fixed number of gates, we present a dynamic programming approach that solves the fli...

متن کامل

Solving fully fuzzy Linear Programming Problem using Breaking Points

Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

ذخیره در منابع من

ذخیره در منابع من ذخیره شده در منابع من

{@ msg_add @}

  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

دانلود متن کامل

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید


عنوان ژورنال:

دوره 14  شماره 1

صفحات  141- 161

تاریخ انتشار 2021-01-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

copyright © 2015-2021