TY - BOOK
T1 - Joint ordering in multiple news-vendor problems : a game-theoretical approach
AU - Slikker, M.
AU - Fransoo, J.C.
AU - Wouters, M.J.F.
PY - 2001
Y1 - 2001
N2 - We study a situation with n retailers, each of them facing a news-vendor problem,
i.e., selling to customers over a finite period of time (product with a short
life cycle, such as fashion). Groups of retailers might improve their expected joint
profit by cooperating. We analyze these situations by defining a cooperative game,
called a general news-vendor game, for such a situation with n retailers. We concentrate
on whether it makes sense to cooperate by studying properties of general
news-vendor games. Besides some results on convexity we prove that general newsvendor
games have non-empty cores, which answers an open question of Hartman
et al. (2000).
AB - We study a situation with n retailers, each of them facing a news-vendor problem,
i.e., selling to customers over a finite period of time (product with a short
life cycle, such as fashion). Groups of retailers might improve their expected joint
profit by cooperating. We analyze these situations by defining a cooperative game,
called a general news-vendor game, for such a situation with n retailers. We concentrate
on whether it makes sense to cooperate by studying properties of general
news-vendor games. Besides some results on convexity we prove that general newsvendor
games have non-empty cores, which answers an open question of Hartman
et al. (2000).
M3 - Report
SN - 90-386-1637-6
T3 - BETA publicatie : working papers
BT - Joint ordering in multiple news-vendor problems : a game-theoretical approach
PB - Technische Universiteit Eindhoven
CY - Eindhoven
ER -