The Complexity of Partition Tasks

被引：2
作者：
Esponda, Fernando [1 ]
Vera-Cruz, Matias
Tarraso, Jorge
Morales, Marco
机构：
[1] Inst Tecnol Autonomo Mexico, Dept Comp Sci, Mexico City, DF, Mexico
来源：
COMPLEXITY | 2010年 / 16卷 / 01期
关键词：
agent synchronization; partition tasks; task complexity; El Farol; SELF-ORGANIZATION; INFORMATION;
D O I：
10.1002/cplx.20324
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this article, we introduce the partition task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system to solve them. We explore, via simulations, some potential applications of these concepts and present some results as examples that highlight their usefulness in policy design scenarios, where the optimal number of elements in a partition or the optimal size of the elements in a partition must be determined. (C) 2010 Wiley Periodicals, Inc. Complexity 16: 56-64, 2010
引用
收藏
页码：56 / 64
页数：9
相关论文
共 29 条
  • [11] Emergence of cooperation and organization in an evolutionary game
    Challet, D
    Zhang, YC
    [J]. PHYSICA A, 1997, 246 (3-4): : 407 - 418
  • [12] Communication and coordination in social networks
    Chwe, MSY
    [J]. REVIEW OF ECONOMIC STUDIES, 2000, 67 (01) : 1 - 16
  • [13] Cook S. A., 1971, P 3 ANN ACM S THEOR, P151, DOI [DOI 10.1145/800157.805047, 10.1145/800157.805047]
  • [14] ELLISON G, 1992, 17 IDEI
  • [15] Erdos P., 1959, PUBL MATH-DEBRECEN, V6, P290, DOI DOI 10.5486/PMD.1959.6.3-4.12
  • [16] INFORMATION THEORY AND STATISTICAL MECHANICS
    JAYNES, ET
    [J]. PHYSICAL REVIEW, 1957, 106 (04): : 620 - 630
  • [17] Johnson D.S., 1978, COMPUTERS INTRACTABI
  • [18] LLOYD S, 2001, IEEE CONTROL SYSTEMS
  • [19] The Standing Ovation Problem
    Miller, JH
    Page, SE
    [J]. COMPLEXITY, 2004, 9 (05) : 8 - 16
  • [20] Mitchell M., 2009, COMPLEXITY GUIDED TO, DOI [10.1093/oso/9780195124415.001.0001, DOI 10.1093/OSO/9780195124415.001.0001]
123