Experiments in Computer Coordinated Decentralized Resource Allocation Systems

该项目将进行实验室实验，为计算机协调分散的资源分配系统的分析提供数据。这项工作集中于一项新的研究计划，以开发(1)进程分配和(2)中央处理(计算机)单元(CPU)服务的容量规划的计算机协调竞价模型。(1)是一个线性规划，而(2)是一个整数规划，用于最大化系统剩余值：输入是处理时间的报价，或者是容量问题中的组件值和预算；报告的盈余最大化算法的输出是容量问题中的服务时间分配和成本分配。分配效率将通过受试者实际赚取的货币盈余与基于诱导分配价值和预算的最大可能盈余的比率来评估。一些研究还将继续研究网络中的一些相关问题--特别是天然气管道网络和电力供应网络。这项工作与理解如何在分散的计算机网络中设计和有效分配时间和设备有关。

This project is to conduct laboratory experiments to producedata for analysis of computer coordinated decentralized resourceallocation systems. The work concentrates on a new research initiative to develop computer coordinated bidding models of (1) process allocation and (2) capacity planning for central processing (computer) unit (CPU) services. (1) is formulated as a linear program, while (2) is an integer program, for maximizing system surplus value: the inputs are bids for processing time, or component values and budgets in the capacity problem; the outputs of the reported surplus maximizing algorithms are service time allocations and cost allocations in capacity problem. Allocative efficiency will be evaluated by the ration of actual monetary surplus earned by subjects to maximum possible surplus based on induced assigned values and budgets. Some research will also continue on somewhat related problems in networks--particularly networks of natural gas pipelines and of electric power supply. This work is relevant to understanding how to design and to efficiently allocate time and equipment in decentralized computer networks.