The complexity of partition tasks

Authors

  • Fernando Eesponda,

    Corresponding author
    1. Department of Computer Science and Department of Economics, Instituto Tecnológico Autónomo de México, México, D.F., México
    • Department of Computer Science and Department of Economics, Instituto Tecnológico Autónomo de México, México, D.F., México
    Search for more papers by this author
  • Matías Vera-Cruz,

    1. Department of Computer Science and Department of Economics, Instituto Tecnológico Autónomo de México, México, D.F., México
    Search for more papers by this author
  • Jorge Tarrasó,

    1. Department of Computer Science and Department of Economics, Instituto Tecnológico Autónomo de México, México, D.F., México
    Search for more papers by this author
  • Marco Morales

    1. Department of Computer Science and Department of Economics, Instituto Tecnológico Autónomo de México, México, D.F., México
    Search for more papers by this author

Abstract

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. © 2010 Wiley Periodicals, Inc. Complexity 16: 56–64, 2010

Ancillary