? 一个保镖分配的双人联合机制
Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | Help
 
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2018, Vol. 33 Issue (4) :823-837    DOI: 10.1007/s11390-018-1858-8
Special Issue on Software Engineering for High-Confidence Systems << Previous Articles | Next Articles >>
一个保镖分配的双人联合机制
José Alberto Fernández-Zepeda1, Daniel Brubeck-Salcedo1, Daniel Fajardo-Delgado2, Héctor Zatarain-Aceves1
1 Department of Computer Science, Center for Scientific Research and Higher Education of Ensenada Ensenada, BC 22860, Mexico;
2 Department of Systems and Computation, Instituto Technológico de Ciudad Guzmán, Guzmán, JAL 49100, Mexico
A Two-Player Coalition Cooperative Scheme for the Bodyguard Allocation Problem
José Alberto Fernández-Zepeda1, Daniel Brubeck-Salcedo1, Daniel Fajardo-Delgado2, Héctor Zatarain-Aceves1
1 Department of Computer Science, Center for Scientific Research and Higher Education of Ensenada Ensenada, BC 22860, Mexico;
2 Department of Systems and Computation, Instituto Technológico de Ciudad Guzmán, Guzmán, JAL 49100, Mexico

摘要
参考文献
相关文章
Download: [PDF 1520KB]  
摘要 我们研究是的保镖分配问题(BAP),这是一个问题优化,描述了分布式系统内具有冲突偏好的两类进程之间的利益冲突。当其中一类进程要最小化它与某个特殊进程(即根)之间的距离,而另一类却要最大化此距离。与此同时,所有的进程都致力于构建一个最大社会福利的通信生成树。此问题的最先进的两种算法总是确保生成树的产生,此生成树满足了系统里纳什均衡(Nash equilibrium)的某个条件;但是此树并不一定会产生最大社会福利。本文我们提出了一个双人联合机制,允许为了找到拥有更好社会福利的另一个进程,一些进程可以干扰或打断纳什均衡。通过使用此联合机制,我们为BAP提出了一个新的算法,FFC-BAPS。我们作了理论和实验分析,结果表明相比针对BAP之前的算法,该算法产生质量更好的近似解。
关键词保镖分配问题   联盟博弈   图形算法   纳什均衡     
Abstract: We address the bodyguard allocation problem (BAP), an optimization problem that illustrates the conflict of interest between two classes of processes with contradictory preferences within a distributed system. While a class of processes prefers to minimize its distance to a particular process called the root, the other class prefers to maximize it; at the same time, all the processes seek to build a communication spanning tree with the maximum social welfare. The two state-of-the-art algorithms for this problem always guarantee the generation of a spanning tree that satisfies a condition of Nash equilibrium in the system; however, such a tree does not necessarily produce the maximum social welfare. In this paper, we propose a two-player coalition cooperative scheme for BAP, which allows some processes to perturb or break a Nash equilibrium to find another one with a better social welfare. By using this cooperative scheme, we propose a new algorithm called FFC-BAPS for BAP. We present both theoretical and empirical analyses which show that this algorithm produces better quality approximate solutions than former algorithms for BAP.
Keywordsbodyguard allocation problem   coalitional game   graph algorithm   Nash equilibrium     
Received 2017-04-27;
本文基金:

This work was partially supported by National Council of Science and Technology (CONACyT) of Mexico under Grant No. 231224, the Program for Professional Teacher Development (PRODEP) of Mexico under Grant No. ITCGUZ-PTC-004, and the National Institute of Technology of Mexico (TecNM) under Grant No. 6307.17-P.

About author: José Alberto Fernández-Zepeda received his B.Sc. and M.Sc. degrees in electronics from the National Autonomous University of Mexico (UNAM) in 1991 and 1994, respectively, and his Ph.D. degree in computer engineering from Louisiana State University in 1999. Since 2000, he is an associate professor in the Department of Computer Science at Center for Scientific Research and Higher Education of Ensenada (CICESE), Ensenada. His research interests include analysis and design of parallel and distributed algorithms and software process improvement in small organizations.
引用本文:   
José Alberto Fernández-Zepeda, Daniel Brubeck-Salcedo.一个保镖分配的双人联合机制[J]  Journal of Computer Science and Technology , 2018,V33(4): 823-837
José Alberto Fernández-Zepeda, Daniel Brubeck-Salcedo, Daniel Fajardo-Delgado, Héctor Zatarain-Aceves.A Two-Player Coalition Cooperative Scheme for the Bodyguard Allocation Problem[J]  Journal of Computer Science and Technology, 2018,V33(4): 823-837
链接本文:  
http://jcst.ict.ac.cn:8080/jcst/CN/10.1007/s11390-018-1858-8
Copyright 2010 by Journal of Computer Science and Technology