机器带激活费用的有限资源博弈排序-数学、运筹学与控制论专业论文.docxVIP

曲阜 曲阜师范大学硕士学位论文 ii ii 机器带激活费用的有限资源博弈排序 摘 要 本文主要研究有限资源的博弈排序问题，以工件排序为例就是指机器台 数有限，并且机器有一定的激活费用。初始状态没有机器被激活，S机器一 旦被激活，就需要支付一定的激活费用，工件相当于局中人，它们选择机器 进行加工使它们的个体费用最小，工件的个体费用函数为其所选择进行加工 的机器的完工时间与其所要承担的激活费用之和，研究的整体目标函数为激 活机器的最长完工时间与总的激活费用之和。用PoA Cprice of anarchy )来衡 量NE时的整体目标函数值与最优值之间的差异。本文的结构安排如下: 第一章首先介绍了研究问题的背景、有关概念及相关的研究进展，并简 要说明了本文研究的主要成果及创新点。 2第二章主要研究了m台同型机情形下的资源分配问题，这时可不妨假设 机器的激活费用都为1. 首先，证得此种情形下的P oA m,然后，分别在m = 2和m = 3两种情形下证明，当W 1时，PoA分别小于 3 和2。此外，分别给出 2 例子证明以上所求PoA的界均为紧界。 第三章研究了两台同类机情形下的资源分配问题，这时可不妨假设两台 机器的速度分别为1和a,机器的激活费用与机器的加工速度一致。 首先，设 计了当W ≤ 1 和W ≥ 1 + a的NE算法，说明了NE的存在性，然后，证得此 时P oA 1 + a,并且给出例子证明1 + a是P oA的紧界。 关键词 资源分配、同型机、同类机、激活费用、纳什均衡、P oA PAGE PAGE iii Limited Resource Allocation Games with Activation Cost ABSTRACT In this paper, we investigate resource allocation games for job scheduling with machine activation cost when the resources are limited. No machines are initially activated. Activating each machine incurs a fixed machine activation cost. Jobs are self-interest-seeking players who choose machines with the objective of minimizing their individual cost which is the load on its chosen machine plus its share in the resources activation cost. The social cost is the sum of the system makespan and activation cost of machines. We assess the quality of pure Nash equilibria in terms of the price of anarchy (PoA). The structure of this paper is organized as follows. In the first chapter, the background and some definitions are introduced. Then, we show the related developments of this problem. Finally, we summarize the main results and innovations of this paper. 2In the second chapter, we consider a system with a fixed number m of identical machines. The activation cost is 1. First, we present a proof that the PoA is less than m when there are m identical machines. We also provide an instance to prove the bound is asymptotically tight. In addition, we prove that the PoA are bounded by 3 and 2 for two special cases of m = 2 and m = 3 when 2 W ≥ 1, respect