Abstract

 
 

References (8)



 


 



A Stochastic Dynamic Programming Model for Valuing Exclusivity from Encroachment in Franchising


Surinder Tikoo


SUNY at New Paltz

Shuguang Liu


SUNY at New Paltz

Suresh K. Nair


University of Connecticut - Department of Operations & Information Management

February 2012

Journal of the Operational Research Society, Vol. 63, Issue 2, pp. 151-159, 2012

Abstract:     
Valuing territorial exclusivity in franchising is difficult because of the uncertainty associated with variables such as future franchise sales and brand strength. We present a stochastic dynamic programming model to value the exclusivity option from the perspective of both the franchisor and the franchisee. When there is positive value to the franchisor of including the exclusivity option in the contract, and to the franchisee of purchasing this option, the likelihood of franchisor-franchisee encroachment-related conflict is reduced. We also discuss structural results and explain our results using a numerical example.

Number of Pages in PDF File: 9

Accepted Paper Series


Date posted: January 13, 2012  

Suggested Citation

Tikoo, Surinder, Liu, Shuguang and Nair, Suresh K., A Stochastic Dynamic Programming Model for Valuing Exclusivity from Encroachment in Franchising (February 2012). Journal of the Operational Research Society, Vol. 63, Issue 2, pp. 151-159, 2012. Available at SSRN: http://ssrn.com/abstract=1983828 or http://dx.doi.org/10.1057/jors.2010.184

Contact Information

Surinder Tikoo (Contact Author)
SUNY at New Paltz ( email )
75 S. Manheim Blvd.
New Paltz, NY 12561
United States
Shuguang Liu
SUNY at New Paltz ( email )
75 S. Manheim Blvd.
New Paltz, NY 12561
United States
Suresh K. Nair
University of Connecticut - Department of Operations & Information Management ( email )
368 Fairfield Road
Storrs, CT 06269-2041
United States
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 122
Downloads: 2
References:  8

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo5 in 0.547 seconds