Routing in Congestible Networks

拥塞网络中的路由

• 批准号: 1008393
• 负责人: Amnon Rapoport
• 金额: $ 26.72万
• 依托单位: University of Arizona
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2010
• 资助国家: 美国
• 起止时间: 2010-09-01 至 2014-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1008393&HistoricalAwards=false
• 关键词: Routing; Congestible; Networks

Networks form the infrastructure for the functioning of modern societies and economies. In particular, transportation networks allow for the move of commuters, mail, and material goods, and communication networks (e.g., Internet) accomplish the same for the transmission of information. When users independently choose their routes in the network, their objective is to minimize their costs (measured in time, money, or energy) without explicitly considering the negative externalities they impose on others. Almost inevitably, over time the demand placed on the network, its topology, or both undergo changes. We do not know if and how network users, who are bounded rationality, susceptible to various biases, and who may not coordinate their decisions, adapt to these changes by choosing new routes. In this research, the PIs will systematically manipulate network structure in an experimental setting to learn how highly motivated network users - human subjects who volunteer to take part in network experiments for payment contingent on their performance - react to these changes.To achieve this purpose, six projects will be undertaken. The theoretical benchmark that drives the investigation is the Nash equilibrium solution concept of game theory. Under this solution, each strategy chosen by any member of the population is a best response to the strategy choices of the other members. The PIs will construct complex networks in a computer-controlled laboratory with multiple routes connecting pre-designated origins to pre-designated destinations, derive the equilibrium solutions for these networks, display them on computer screens, and ask subjects to independently choose routes that minimize their individual cost. The patterns of behavior elicited will then be compared with the Nash equilibrium predictions before and after manipulation of the network, deviations from equilibrium play, if any, will be identified and accounted for using new theories based on concepts and ideas from economics, psychology, and organization science. In terms of broader signficance, the findings from these studies will be useful for planning the expansion of networks to meet changes in demand or in the structure of the network, for increasing efficiency in networks, and for determining what information on network conditions to display on-line to network users.

网络构成了现代社会和经济运作的基础设施。特别是，运输网络允许通勤者、邮件和物质货物的移动，而通信网络（例如互联网）则实现同样的信息传输。当用户在网络中独立选择路线时，他们的目标是最小化他们的成本（以时间、金钱或能源来衡量），而不明确考虑他们给他人带来的负外部性。随着时间的推移，对网络、其拓扑或两者的需求几乎不可避免地会发生变化。我们不知道网络用户是否以及如何通过选择新的路线来适应这些变化，因为网络用户是有限理性的，容易受到各种偏见的影响，并且可能不会协调他们的决策。在这项研究中，PI 将在实验环境中系统地操纵网络结构，以了解高度积极的网络用户（自愿参加网络实验并根据其表现获得报酬的人类受试者）对这些变化的反应。为了实现这一目的，将开展六个项目。 推动研究的理论基准是博弈论的纳什均衡解概念。在这种解决方案下，群体中任何成员选择的每种策略都是对其他成员策略选择的最佳回应。 PI 将在计算机控制的实验室中构建复杂的网络，其中有多条路线将预先指定的起点连接到预先指定的目的地，得出这些网络的平衡解决方案，将其显示在计算机屏幕上，并要求受试者独立选择将个人成本最小化的路线。然后，将所引发的行为模式与网络操纵前后的纳什均衡预测进行比较，如果有的话，将使用基于经济学、心理学和组织科学的概念和思想的新理论来识别和解释与均衡游戏的偏差。就更广泛的意义而言，这些研究的结果将有助于规划网络的扩展，以满足需求或网络结构的变化，提高网络效率，以及确定向网络用户在线显示哪些网络状况信息。