基于机制设计理论的一些最优化问题的研究-应用数学专业论文.docxVIP

Ab弭穗ctAbstract Ab弭穗ct Abstract Mecha工1ism design is the sub垃eld。f microeconomics and g锄e tbeory that considers how to implement good system—wide solutions．A large pan of research in computer science is concemed时th protocols aIld algori血ms for intercoImected c011ections of computers．1lhe desigller of such an algorithIn protocol algorithm pmtocol always makes an implicit ass啪ption tbat the participating computers 州11 act as instructed—except，perhaps，for廿le faulty maIicious ones。Computers the Intemetbelong to di腩rent persons ofganizations a11d will likely do what is most beneficial to their owners．We cannot s曲ply expect each computer the Intemet to faitlIfully follow me designed pmtocols algorithms．It is more 『eaSonable协expect that each computer will姆to m删puIate it flor its o雌rs’ benefit．Such a11 algorithrn protocol must merefore be designed in adVance for thjs l(ind of behavior!Ifl this p印er we suggested a行amework for studying opnmization pmblems that inVoIve selfish panicipants．As such p州icipallts，agents are capable of mallipulating t}le algo疵111ll；the algorithm desigller should in advance that the agems’intereSts best served by telling trumfully．Following notions f如m t11e field of mechaIlism design，we suggest a疳amework for studying such algor．thIns，In恤ls model mc alg硎tllmic s01ution is adomed w．th pa舯ents to me panicipants．The payments血ould be care如11y chosen to motiVate a11 panieipants to act as也e algorithIn de嫡弘er硝sheS．First，we introduce也e basic notions and basic pr叩erty ofmechallism desigⅡ．nlen，we印ply也e staI|dard tooIs of mechallism design to the shonest pathS pmblem a11d the minim啪span血ng订ee problem．Finally，task scheduling problem is corlcemed m this papeL We present severaJ theorems regarding this problem including an印proximation nlechaIIism， lower bounds aIld randomizcd mechanism． Key words：mecllanism desi印；V(迁mechaⅡism；the shonest paths pmblem；me minimum spanⅡing；task scheduling n 符号约定符号约定 符号约定 符号约定 o 结果 o 结果集 p， 代理f的类型 代理f的类型集 代理f的效用 ●) 社会选择函数 机制 代理f的策略集 q