188宝金博页面版

  • 图案背景
  • 纯色背景
视图
标记
批注
批注本地保存成功，开通会员云端永久保存 去开通
D795112579..

上传于：2016-03-24

粉丝量：3

该文档贡献者很忙，什么也没留下。


  • 相关
  • 目录
  • 笔记
  • 书签

188宝金博页面版:更多相关文档

  • The Price of Anarchy in Cooperative Network Creation Games

    星级： 4 页

  • THE PRICE OF ANARCHY IN COOPERATIVE NETWORK CREATION GAMES…

    星级： 12 页

  • The Price of Anarchy in Network Creation Games

    星级： 14 页

  • the price of anarchy in network creation games

    星级： 7 页

  • The price of anarchy in network creation games

    星级： 7 页

  • The Price of Anarchy in Network Creation Games Is (Mostly) Constant

    星级： 12 页

  • the price of anarchy in network creation games is (mostly) constant

    星级： 20 页

  • The Price of Anarchy in Network Creation Games Is (Mostly) Constant

    星级： 20 页

  • Constant Price of Anarchy in Network Creation Games via Public…

    星级： 13 页

  • Constant Price of Anarchy in Network Creation Games via Public Service Advertising

    星级： 10 页

  • Price of Anarchy in Network Games

    星级： 56 页

暂无目录

点击鼠标右键菜单,创建目录

    暂无笔记

    选择文本，点击鼠标右键菜单，添加笔记

    暂无书签

    在左侧文档中，点击鼠标右键，添加书签

    188宝金博页面版: The Price of Anarchy in Cooperative Network Creation Games

    下载积分： 2000

    内容提示： The Price of Anarchy inCooperative Network Creation GamesERIK D. DEMAINEMIT, Cambridge, MassachusettsandMOHAMMADTAGHI HAJIAGHAYIAT&T Labs — Research, Florham Park, New JerseyandHAMID MAHINISharif University of Technology, Tehran, IranandMORTEZA ZADIMOGHADDAMMIT, Cambridge, Massachusetts1. INTRODUCTIONA fundamental family of problems at the intersection between computer science andoperations research is network design. This area of research has become increasinglyimportant given the continued growth of com...

    文档格式：PDF | 页数：20 | 浏览次数：33 | 上传日期：2016-03-24 15:27:03 | 文档星级：
    The Price of Anarchy inCooperative Network Creation GamesERIK D. DEMAINEMIT, Cambridge, MassachusettsandMOHAMMADTAGHI HAJIAGHAYIAT&T Labs — Research, Florham Park, New JerseyandHAMID MAHINISharif University of Technology, Tehran, IranandMORTEZA ZADIMOGHADDAMMIT, Cambridge, Massachusetts1. INTRODUCTIONA fundamental family of problems at the intersection between computer science andoperations research is network design. This area of research has become increasinglyimportant given the continued growth of computer networks such as the Internet.Traditionally, we want to find a minimum-cost (sub)network that satisfies somespecified property such as k-connectivity or connectivity on terminals (as in theclassic Steiner tree problem). This goal captures the (possibly incremental) creationcost of the network, but does not incorporate the cost of actually using the network.In contrast, network routing has the goal of optimizing the usage cost of the network,but assumes that the network has already been created.Network creation games attempt to unify the network design and network routingproblems by modeling both creation and usage costs. In general, the game is playedon a host graph, where each node is an independent agent (player), and the goalis to create a network from a subgraph of the host graph. Collectively, the nodesdecide which edges of the host graph are worth creating as links in the network.Every link has the same creation cost α. (Equivalently, links have creation costs ofA preliminary version of this paper appeared in Proceedings of the 26th International Symposiumon Theoretical Aspects of Computer Science, 2008, pages 171–182. This work was done whileM. Hajiaghayi was at MIT and CMU and M. Zadimoghaddam was at Sharif University of Tech-nology. H. Mahini was supported in part by Institute for Theoretical Physics and Mathematics(IPM) under grant number CS1384-2-01.Author’s addresses: E. Demaine, M. Zadimoghaddam, Computer Science and Artificial Intelli-gence Laboratory, MIT, 32 Vassar St., Cambridge, MA 02139, USA, e-mail: {edemaine,morteza}@mit.edu; M. Hajiaghayi, AT&T Labs — Research, 180 Park Ave., Florham Park, NJ 07932, USA,e-mail: hajiagha@research.att.com; H. Mahini, Department of Computer Engineering, Sharif Uni-versity of Technology, Azadi St., Tehran, Iran, e-mail: mahini@ce.sharif.edu.ACM SIGecom Exchanges, Vol. 8, No. 2, December 2009.

    阅读了该文档的用户还阅读了这些文档

    188宝金博页面版:关于我们

    188宝金博页面版:帮助中心

    188宝金博页面版:关注我们

    • 新浪微博

    关注188宝金博页面版公众号

    188宝金博页面版
    阅读
    APP
    阅读
    返回
    顶部
    188宝金博页面版官网登录在线平台入口（2026已更新）—江苏协昌电子科技股份有限公司