IDEAS home Printed from https://ideas.repec.org/a/hin/complx/7802169.html
   My bibliography  Save this article

Human Search in a Fitness Landscape: How to Assess the Difficulty of a Search Problem

Author

Listed:
  • Oana Vuculescu
  • Mads Kock Pedersen
  • Jacob F. Sherson
  • Carsten Bergenholtz

Abstract

Computational modeling is widely used to study how humans and organizations search and solve problems in fields such as economics, management, cultural evolution, and computer science. We argue that current computational modeling research on human problem-solving needs to address several fundamental issues in order to generate more meaningful and falsifiable contributions. Based on comparative simulations and a new type of visualization of how to assess the nature of the fitness landscape, we address two key assumptions that approaches such as the NK framework rely on: that the NK captures the continuum of the complexity of empirical fitness landscapes and that search behavior is a distinct component, independent from the topology of the fitness landscape. We show the limitations of the most common approach to conceptualize how complex, or rugged, a landscape is, as well as how the nature of the fitness landscape is fundamentally intertwined with search behavior. Finally, we outline broader implications for how to simulate problem-solving.

Suggested Citation

  • Oana Vuculescu & Mads Kock Pedersen & Jacob F. Sherson & Carsten Bergenholtz, 2020. "Human Search in a Fitness Landscape: How to Assess the Difficulty of a Search Problem," Complexity, Hindawi, vol. 2020, pages 1-11, July.
  • Handle: RePEc:hin:complx:7802169
    DOI: 10.1155/2020/7802169
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/7802169.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/7802169.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/7802169?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sai Yayavaram & Sasanka Sekhar Chanda, 2023. "Decision making under high complexity: a computational model for the science of muddling through," Computational and Mathematical Organization Theory, Springer, vol. 29(2), pages 300-335, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:7802169. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.