English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Current trends in model construction in the field of agent-based computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictitious play, Bayesian learning) or are inspired by artificial intelligence (e.g. reinforcement learning). Evidence from experiments with human subjects puts the first approach in doubt, whereas the second one imposes significant computational and memory requirements on agents. In this paper, we introduce an efficient computational implementation of n-th order rationality using recursive simulation. An agent is n-th order rational if it determines its best response assuming that other agents are (n-1)-th order rational and zero-order agents behave according to a specified, non-strategic, rule. In recursive simulations, the simulated decision makers use simulation to inform their own decision making (search for best responses). Our goal is to provide agent modelers with an off-the-shelf implementation of n-th order rationality that leads to model-consistent behaviors of agents, without requiring a learning phase. We extend two classic games (Shapley's fictitious play and Colonel Blotto) to illustrate aspects of the n-th order rationality concept as implemented in our framework.

Bounded rationality via recursion