中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
热门
A note on a selfish bin packing problem

文献类型:期刊论文

作者Ma ruixin; Dosa Gyorgy; Han xin; Ting hingfung; Ye deshi; Zhang yong
刊名Journal of Global Optimization
出版日期2013
英文摘要In this paper, we consider a selfish bin packing problem, where each item is a selfish player and wants to minimize its cost. In our new model, if there are k itemspacked in the same bin, then each item pays a cost 1/k, where k ≥ 1. First we find a Nash Equilibrium (NE) in time O(n log n) within a social cost at most 1.69103OPT + 3, where OPT is the social cost of an optimal packing; where n is the number of items or players; then we give tight bounds for the worst NE on the social cost; finally we show that any feasible packing can be converged to a Nash Equilibrium in O(n 2) steps without increasing the social cost. © 2012 Springer Science+Business Media, LLC.(18 refs)
收录类别SCI
原文出处http://link.springer.com/article/10.1007/s10898-012-9856-9
语种英语
WOS记录号WOS:000321921500013
源URL[http://ir.siat.ac.cn:8080/handle/172644/5036]  
专题深圳先进技术研究院_数字所
作者单位Journal of Global Optimization
推荐引用方式
GB/T 7714
Ma ruixin,Dosa Gyorgy,Han xin,et al. A note on a selfish bin packing problem[J]. Journal of Global Optimization,2013.
APA Ma ruixin,Dosa Gyorgy,Han xin,Ting hingfung,Ye deshi,&Zhang yong.(2013).A note on a selfish bin packing problem.Journal of Global Optimization.
MLA Ma ruixin,et al."A note on a selfish bin packing problem".Journal of Global Optimization (2013).

入库方式: OAI收割

来源:深圳先进技术研究院

浏览0
下载0
收藏0
其他版本

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