In this paper, we study the newsvendor game with supply uncertainty, where multiple retailers form a coalition to cooperate to place orders to minimize the cost and share risk facing uncertain supplies and demands. After the orders are delivered and the demands are realized, the actual arrival quantities are allocated among the retailers to minimize the total cost. We compute the cost functions by using two-stage stochastic programming model and show that the cooperative game has a nonempty core. Also we propose a method to calculate an allocation in the core.
목차
Abstract 1. Introduction 2. Notation and Model 3. Computation of the Characteristic Functions and Allocation 3.1. The Case that the Supply Uncertainty and Demands are Given 3.2. The Case with Supply Uncertainties and Random Demands 4. Nonemptiness of the Core 5. Conclusion Acknowledgments References
키워드
Newsvendor gamesupply uncertaintycorecooperation game
저자
Xiaojie Yan [ Department of Logistics Management, School of Economics and Management Beijing Jiaotong University, Beijing, China ]
Jun Shi [ Logistics Operation II, Beijing Benz Automotive CO.LTD. Beijing, China ]
보안공학연구지원센터(IJSIP) [Science & Engineering Research Support Center, Republic of Korea(IJSIP)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Signal Processing, Image Processing and Pattern Recognition
간기
격월간
pISSN
2005-4254
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.9 No.6