CSpace  > 系统科学研究所
Selfish bin covering
Cao, Zhigang; Yang, Xiaoguang
2011-11-25
发表期刊THEORETICAL COMPUTER SCIENCE
ISSN0304-3975
卷号412期号:50页码:7049-7058
摘要In this paper, we address the selfish bin covering problem, which is greatly related both to the bin covering problem, and to the weighted majority game. What we are mainly concerned with is how much the lack of central coordination harms social welfare. Besides the standard PoA and PoS, which are based on Nash equilibrium, we also take into account the strong Nash equilibrium, and several new equilibrium concepts. For each equilibrium concept, the corresponding PoA and PoS are given, and the problems of computing an arbitrary equilibrium, as well as approximating the best one, are also considered. (C) 2011 Elsevier B.V. All rights reserved.
关键词Selfish bin covering Weighted majority games Price of anarchy Price of stability Nash equilibrium
DOI10.1016/j.tcs.2011.09.017
语种英语
资助项目973 Program[201008731405] ; National Natural Science Foundation of China[71101140] ; National Natural Science Foundation of China[11101248]
WOS研究方向Computer Science
WOS类目Computer Science, Theory & Methods
WOS记录号WOS:000297442600015
出版者ELSEVIER SCIENCE BV
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/13073
专题系统科学研究所
通讯作者Cao, Zhigang
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Management Decis & Informat Syst, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Cao, Zhigang,Yang, Xiaoguang. Selfish bin covering[J]. THEORETICAL COMPUTER SCIENCE,2011,412(50):7049-7058.
APA Cao, Zhigang,&Yang, Xiaoguang.(2011).Selfish bin covering.THEORETICAL COMPUTER SCIENCE,412(50),7049-7058.
MLA Cao, Zhigang,et al."Selfish bin covering".THEORETICAL COMPUTER SCIENCE 412.50(2011):7049-7058.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Cao, Zhigang]的文章
[Yang, Xiaoguang]的文章
百度学术
百度学术中相似的文章
[Cao, Zhigang]的文章
[Yang, Xiaoguang]的文章
必应学术
必应学术中相似的文章
[Cao, Zhigang]的文章
[Yang, Xiaoguang]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。