首页 > 资料专栏 > 制造 > 物料采购 > 供方管理 > 制造商与不同质供应商博弈分析

制造商与不同质供应商博弈分析

浙江博弈
V 实名认证
内容提供者
资料大小:89KB(压缩后)
文档格式:WinRAR
资料语言:中文版/英文版/日文版
解压密码:m448
更新时间:2018/7/19(发布于浙江)
阅读:4
类型:积分资料
积分:8分 (VIP无积分限制)
推荐:升级会员

   点此下载 ==>> 点击下载文档


文本描述
:2007212204
E2mail:jpf200106@mail.sdu
‰1,2
(1.··§§ˇˇ,‰¤¨“362014;2.··§ˇˇ,‰¤¨“362014)
Gameanalysisofmanufactureranddifferentsuppliers
JIANGPeng2fei1,WANGZhen2
(1.DepartmentofMathematics,Yang2EnUniversity,Quanzhou362014,China;
2.DepartmentofBusinessAdministration,Yang2EnUniversity,Quanzhou362014,China)
Abstract:Thechiefmodeofmarketcompetitionhasturneditsstepstothecompanycoalitionsfromthatamongcompanies,which
iscalledsupplychainscompetition.Accordingtotherealconditionofsupplychainmanagement,agamemodelofcompanieson
atwo2stagesupplychainwithdifferentsuppliersandonemanufacturerwasbuilt.Theequilibriumvalueandtheinfluentialfactors
ofplayerspayoffswereanalyzed.Aconclusionwasmadethatboththesupplierandmanufacturershouldseekmorecompaniesto
tradeoff,andtherelationshipbetweenthemisnotonlycompetitivebutabsolutelywin2win–.
Keywords:supplychain;Nashequilibrium;Cournotcompetition```—”ˇ6,'”……'———˙˙—….––‰¤`
`'`·ˇ'”……`‰‰‰”'—,`¨ˇˇ
1”…
Vol.38No.2
JOURNALOFSHANDONGUNIVERSITY(ENGINEERINGSCIENCE)
20084
Apr.2008
(1)'渨`·渨ˇ渨—m(m3)'渨渨渨,˙渨渨渨1,渨渨––,––…˙“c11,c12,,
c1m;
(2)渨渨渨渨渨˙'渨`·渨”—渨渨,渨渨渨渨渨渨2,渨1渨渨渨渨2,渨––
渨“c2;
(3)2渨——˙˙……渨“……渨”ˇˇ——”q2=a2-p2,渨—a2“,p2”q2––––2
渨—渨””……”`.
2—……渨””‰‰
渨渨˙`‰‰‰'渨:渨渨渨‰‰,'渨渨渨渨……¤渨”渨…¨渨渨渨,ˇˇ1渨'—‰””('渨渨渨渨
””);渨渨‰‰,渨渨渨渨渨¤……ˇ2ˇˇ渨渨渨渨··(渨渨渨渨渨渨””).
f=(a2-p2)(p2-c2-p1),(1)
p32=(a2+c2+p1)/2,(2)
q32=(a2-c2-p1)/2,(3)
q1=q32=(a2-c2-p1)/2.(4)
渨渨‰‰,渨–1渨—˙˙”¨¤””,'渨渨渨渨……‰——渨渨`渨渨”渨7.渨渨‰(4)渨渨‰1
……渨渨—˙˙渨·”“
p1=a2-c2-2q1,(5)
渨§渨渨渨`“q1i,i=1,2,,m,渨渨q1=
m
i=1q1i,渨渨”“
ui=q1i(p1-c1i)=q1ia2-c2-2
m
j=1q1j-c1i,i=1,2,,m.(6)
q1i=a2-c2-2
m
j=1,jiq1j-c1i/4.(7)
渨渨·渨渨‰m·渨”,‰渨ˇm·渨”`“`渨‰渨,‰渨渨‰‰渨˙'渨渨—'渨渨渨渨渨””
q31i=|Bi|/|A|,A=
11/21/2
1/211/2
1/21/21m`m
.
Bi˙渨渨A渨渨渨i`—ˇˇ`
(a2-c2-c11)/4(a2-c2-c12)/4(a2-c2-c1m)/4T
渨渨‰渨渨渨渨渨.
q31i=a2-c2+
m
j=1,jic1j-mc1i/[2(m+1)],i=1,2,,m.(8)
·–1渨渨渨`“
q31=
m
i=1q1i=(m(a2-c2)-
m
j=1c1j)/[2(m+1)],(9)
q32=q31=(m(a2-c2)-
m
j=1c1j)/[2(m+1)].(10)
p32=((m+2)a2+mc2+
m
j=1c1j)/[2(m+1)].(11)
䲠䲠˙˙˙˙‰‰䲠䲠䲠䲠‰,`‰‰‰'䲠䲠¤䲠䲠`Nash䲠””‰‰“
((q311,q312,,q31m),p32).
q31i=(a2-c2+
m
j=1,jic1j-mc1i)/[2(m+1)],i=1,2,,m,
p32=((m+2)a2+mc2+
m
j=1c1j)/[2(m+1)].
(12)
‰‰(12)·¨䲠¨䲠䲠䲠”,䲠䲠‰䲠䲠§䲠䲠(䲠¨)䲠䲠“
v(i)=((a2-c2+
m
j=1,jic1j-mc1i)
2)/[4(m+1)2],i=1,2,,m,(13)
v(m+1)=[m(a2-c2)-
m
j=1c1j]
2/[4(m+1)2].(14)
䲠䲠‰(13),(14)䲠䲠·,䲠—'䲠䲠䲠䲠䲠,䲠䲠˙'䲠䲠䲠`m䲠…”;䲠䲠䲠䲠䲠䲠䲠䲠䲠䲠˙
䲠—‰‰䲠䲠䲠䲠䲠䲠䲠––,'䲠䲠䲠䲠䲠䲠`¨䲠䲠,䲠䲠“䲠䲠䲠䲠䲠䲠䲠䲠……䲠䲠䲠䲠䲠䲠.䲠,䲠䲠䲠䲠䲠䲠“ˇ䲠䲠……
䲠䲠䲠䲠䲠䲠,䲠‰䲠“‰‰䲠䲠䲠䲠䲠––,–,䲠䲠䲠䲠‰‰䲠'䲠䲠䲠––䲠,䲠䲠“䲠䲠䲠䲠䲠䲠
3䲠䲠
䲠䲠1䲠'䲠`·䲠—䲠—3'䲠䲠䲠䲠'1,䲠––––“c11=4,c12=5,c13=6,ˇˇ¨,m=3,n=4,
䲠䲠䲠䲠䲠䲠䲠2䲠––“c2=10,–``a2=25.
䲠䲠—䲠””‰‰䲠‰,…䲠䲠‰§䲠䲠䲠””ˇ䲠䲠䲠––“
v1=196/64,v2=100/64,v3=36/64,v4=900/64.(15)
ˇˇ¨,䲠䲠䲠䲠䲠䲠`'䲠`·䲠ˇ··䲠䲠䲠,䲠䲠䲠··䲠䲠¨䲠䲠䲠'䲠䲠䲠.䲠䲠䲠䲠䲠䲠䲠䲠䲠'䲠䲠䲠—䲠ˇ··䲠䲠
‰‰䲠䲠––䲠–䲠䲠䲠䲠䲠˙˙—䲠”䲠䲠,…䲠䲠䲠䲠䲠䲠䲠䲠䲠䲠䲠䲠,䲠䲠……䲠䲠䲠䲠䲠䲠䲠䲠…䲠`.䲠䲠
䲠䲠䲠䲠䲠䲠䲠,䲠䲠˙䲠“䲠‰‰‰䲠䲠––,–䲠‰'䲠䲠䲠䲠`䲠䲠䲠䲠”ˇ䲠‰.䲠䲠˙˙
4‰
––‰¤``'䲠`·䲠ˇ䲠䲠'䲠䲠䲠””—䲠䲠…·䲠䲠䲠䲠䲠䲠……䲠`‰‰‰'䲠—,˙˙`—䲠
䲠`Nash䲠””‰‰.䲠䲠—䲠””‰‰䲠䲠䲠—‰,䲠¨䲠䲠䲠䲠䲠ˇˇ䲠䲠‰——`,ˇˇ䲠䲠§䲠䲠
”—䲠䲠,䲠䲠‰䲠䲠䲠䲠··䲠䲠¨䲠䲠䲠'䲠䲠䲠.'䲠䲠䲠䲠…䲠䲠˙˙``䲠䲠䲠䲠䲠䲠,……·—”
‰‰䲠––`¨,䲠䲠䲠䲠䲠䲠.–,'䲠䲠䲠”'䲠䲠䲠䲠䲠`”ˇ䲠䲠,`䲠䲠ˇˇ䲠–.
(ˇ䲠“䲠䲠126䲠)
:˙˙“··§,2005.
CHENJian,CHENXi2long,SONGXi2ping.Auctionstheory
andonlineauction[M].Beijing:TsinghuaUniversityPress,
2005.
[13].—……—[M].––':—
…,2004.
MAJun.Auctionsmodelsanditsapplication[M].Beijing:
ChinaFinancialandEconomicPress,2004.
[14],”.ˇ—–``……–¨‰ˇ[J].
ˇˇ§§.2002,22(3):3432354.
DULi,HUQi2ying.Acomparativeanalysisofreserveprice
onsequentialinternetauctions[J].JournalofSystemsScience
andMathematicalSciences,2002,22(3):3432354.
(––…:——`˙˙)
(ˇ‰‰116)
[1].Rough…“¨[M].:‰¤……··§,2001.
WANGGuo2yin.Roughsettheoryandknowledgeacquisition[M].Xian:XianJiaotongUniversityPress,2001.
[2]SKOWRONA,POLKOWSKIL.Synthesisofdecisionsystemsfromdatatables[M]//LINTY,CERCONEN.Roughsetsanddatamin2
ing:analysisforimprecisedata.Boston:KluwerAcademicPublishers,1997:2592300.
[3]HUKY,DIAOLL,LUYC,etal.Aheuristicoptimalreductalgorithm[C]//AppeardinProceedingsof2ndInternationalConference
onIntelligentDataEngineeringandAutomatedLearning.Hongkong:[s.n.],2000:13215.
[4]DOMINIKS,JAKUBW.Orderbasedgeneticalgorithmsforthesearchofapproximateentropyreducts[C]//WANGG.RSFDGrC2003,
LNAI2639.Berlin,Heidelberg:Springer2Verlag,2003:3082311.
[5],ˇ··,——.‰¤[J].…§,2004,26(1):92294.
LIKe2wen,WUMeng2da,ZHANGXiong2ming.Aheuristicalgorithmforreduction[J]puterEngineering&Science,2004,26
(1):92294.
(––…:——`˙˙)
(ˇ‰‰119)
[1]”.—¨ˇ``……'`·[J].—``¤,2000,3:8211.
HEMing2ke.Knowthelogisticsandsupplychainagain[J].ChinaMaterialsDistribution,2000,3:8211.
[2],˙˙‰‰.……'`·'—[J].§……,2007,7(24):648826491.
WANGLei,WANGQing2jin.Servicesharing,pricediscountandthegamemodelofsupplychain[J].ScienceTechnologyandEngineer2
ing,2007,7(24):648826491.
[3]WANGY,GERCHAKY.SupplychaincoordinationwhendemandisShelf2Spacedependent[J].Manufacturing&ServiceManagement,
2001,3(1):82287.
[4]“,ˇ.`“'[J].§–¤,2004,18(3):65268.
LUShao2hua,TAOZhi2xiang.Profit2allottinggameinvirtualenterprise[J].JournalofIndustrialEngineeringandEngineeringManage2
ment,2004,18(3):65268.
[5]‰,˙,”.…'`·'—[J].‰··§§–¤:§,2007,42(2):51255.
JIANGPeng2fei,SHAYa2jun,HUFa2sheng.Differentgamemodelsforatwo2stagesupplychain[J].JournalofShandongUniversity:
NaturalScience,2007,42(2):51255.
[6]PEDROMREYES.Logisticsnetworks:agametheoryapplicationforsolvingthetransshipmentproblem[J].AppliedMathematicsand
Computation,2005,168:141921431.
[7]ˇ,ˇˇ,.—'[J].ˇˇ…,2002,11:822105.
XUEWei2xian,FENGXian2zhong,CHENAi2juan,etal.Gameanalysisintheoligopolymarket[J].SystemsEngineering2theory&
Practice,2002,11:822105.
(––…:——`˙˙)
。。。以上简介无排版格式,详细内容请下载查看