首页 | 本学科首页   官方微博 | 高级检索  
     检索      

网络上的选址博弈模型
引用本文:李玉龙,李建国.网络上的选址博弈模型[J].数学的实践与认识,2010,40(1).
作者姓名:李玉龙  李建国
作者单位:清华大学数学科学系,北京,100084
基金项目:中科院方向性项目(KSCXZ-SW-324)
摘    要:研究了具有竞争关系的两公司在由客户组成的网络上先后进行选址的情形,将这种情形建模成一个S tackelberg博弈.由于商店选址之后,客户的行为是自发的,在这种情况下,客户之间往往会有合作,以降低车辆路径费用.提出利用车辆路径合作博弈来模拟客户的行为,从而确定各商店的客户集,并将这种方法与直接利用客户到商店的距离来确定商店的客户集的方法进行了统计意义上的比较.

关 键 词:选址博弈  车辆路径合作博弈  核仁  Stackelberg平衡

Location Game on Networks
LI Yu-long,LI Jian-guo.Location Game on Networks[J].Mathematics in Practice and Theory,2010,40(1).
Authors:LI Yu-long  LI Jian-guo
Institution:LI Yu-long,LI Jian-guo(Department of Mathematical Science,Tsinghua University,Beijing 100084,China)
Abstract:This paper considers the situation of two competing companies entering a network market in order,and modeling this situation as a Stackelberg game.After both companies have entered the market,customers are free to choose anyone of them as the supplier.Because going to the company alone usually costs customers more,they cooperate with each other in order to reduce their vehicle routing cost.We propose using vehicle routing game to mimic this cooperation and determine which customer will go to which company.F...
Keywords:location game  vehicle routing game  nucleolus  Stackelberg equilibrium  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号