.png){kind=icon}
返回
COMPETITIVE LOCATION ON A NETWORK
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)90224-B.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Consider a network with a given number of customers at fixed locations (vertices) and where each customer will purchase a commodity from the facility closer to his,location more frequently than from a remote one. As a generalization of the Condorcet concept we define an optimal point as a location such that there exists no competitor with higher expected value. We show that the set of optimal points consists entirely of vertices. In general we provide polynomial algorithms to answer the question as to: What is the maximum percentage of customers located on the network prefering some rival point to an existing location? Suboptimal points where the maximal relative rejection by a rival point is minimal are determined in polynomial time.
Keyword:
NETWORK
CONDORCET POINT
SIMPSON POINT
EQUILIBRIUM
COMPETITIVE LOCATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容