Network-based phase space analysis of the el farol bar problem

Shane St. Luce*, Hiroki Sayama


研究成果: Article査読

2 被引用数 (Scopus)


The El Farol Bar problem highlights the issue of bounded rationality through a coordination problem where agents must decide individually whether or not to attend a bar without prior communication. Each agent is provided a set of attendance predictors (or decision-making strategies) and uses the previous bar attendances to guess bar attendance for a given week to determine if the bar is worth attending. We previously showed how the distribution of used strategies among the population settles into an attractor by using a spatial phase space. However, this approach was limited as it required N − 1 dimensions to fully visualize the phase space of the problem, where N is the number of strategies available. Here we propose a new approach to phase space visualization and analysis by converting the strategy dynamics into a state transition network centered on strategy distributions. The resulting weighted, directed network gives a clearer representation of the strategy dynamics once we define an attractor of the strategy phase space as a sink-strongly connected component. This enables us to study the resulting network to draw conclusions about the performance of the different strategies. We find that this approach not only is applicable to the El Farol Bar problem, but also addresses the dimensionality issue and is theoretically applicable to a wide variety of discretized complex systems.

ジャーナルArtificial Life
出版ステータスPublished - 2021 11月 2

ASJC Scopus subject areas

  • コンピュータ サイエンス(その他)
  • 生態、進化、行動および分類学
  • 生化学、遺伝学、分子生物学(その他)


「Network-based phase space analysis of the el farol bar problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。