Luis R. Izquierdo's repositories

standingovation

NetLogo model described by Miller and Page in their paper: Miller, J. H. and S. E. Page (2004). "The standing ovation problem" Complexity 9(5): 8-16.

Language:NetLogoLicense:GPL-3.0Stargazers:4Issues:2Issues:0

EvoDyn-3s

A Mathematica computable document to analyse evolutionary dynamics in 3-strategy games

Language:MathematicaLicense:GPL-3.0Stargazers:3Issues:0Issues:0

agent-based-evolutionary-game-dynamics

NetLogo models developed in the book "Agent-Based Evolutionary Game Dynamics"

Language:NetLogoLicense:GPL-3.0Stargazers:2Issues:2Issues:0

abed-1pop

Agent-Based Evolutionary Dynamics in 1 population

Language:SCSSLicense:GPL-3.0Stargazers:1Issues:0Issues:0

recombranch

NetLogo model of technological transitions designed to explore the dynamics of innovation.

Language:NetLogoLicense:GPL-3.0Stargazers:1Issues:2Issues:0

wc-lr-bertrand

NetLogo model designed to analyse the Win-Continue, Lose-Reverse (WC-LR) rule in duopolies with differentiated products where firms compete in prices.

Language:NetLogoLicense:GPL-3.0Stargazers:1Issues:0Issues:0

abed

Agent-Based Evolutionary Dynamics

Language:JavaScriptLicense:GPL-3.0Stargazers:0Issues:3Issues:0

abed-2pop

Agent-Based Evolutionary Dynamics in 2 populations

Language:SCSSLicense:GPL-3.0Stargazers:0Issues:0Issues:0

LeLeLe

NetLogo model designed to analyse the effect of conditional dissociation in the evolutionary emergence of cooperation.

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:2Issues:0

micopro

NetLogo model designed to analyze the consequences of mixing two groups that have different predispositions to adopt a certain trait (or infection)

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:2Issues:0

schelling

Schelling's model of spatial segregation.

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:0Issues:0

3s-RD-selective-assortment

Mathematica notebook created to analyze the replicator dynamics in 3-strategy games under positive and negative selective assortment

Language:MathematicaLicense:GPL-3.0Stargazers:0Issues:0Issues:0

bep-3s-sp

Mathematica notebook created to analyze Best Experienced Payoff (BEP) dynamics in 3 strategy games with several players

Language:MathematicaLicense:GPL-3.0Stargazers:0Issues:1Issues:0

bep-centipede

Best Experienced Payoff dynamics in the Centipede game

Language:MathematicaLicense:GPL-3.0Stargazers:0Issues:0Issues:0

bep-tcg

Mathematica notebook created to analyze Best Experienced Payoff (BEP) dynamics in 3-strategy Tacit Coordination Games (TCG)

Language:MathematicaLicense:GPL-3.0Stargazers:0Issues:1Issues:0

centipede-test-two

NetLogo model designed to analyze the "Test two, choose the better" rule in the centipede game.

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:0Issues:0

Cyp-By_fluctPop

NetLogo model designed to analyse the effect of conditional dissociation in the evolutionary emergence of cooperation.

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:2Issues:0
Language:HTMLStargazers:0Issues:2Issues:0

mathematica-scripts

Short Mathematica notebooks that I will probably use again in the future

Language:MathematicaLicense:GPL-3.0Stargazers:0Issues:0Issues:0

mequ

NetLogo model model designed to study the effects of quality uncertainty and incomplete information on market dynamics.

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:0Issues:0
License:GPL-3.0Stargazers:0Issues:0Issues:0

nBEPA1

Code useful to analyze the nBEPA1 revision protocol. This protocol is a noisy version of the Best Experienced Payoff protocol, where agents test all their strategies and they try each of them only once

Language:MathematicaLicense:GPL-3.0Stargazers:0Issues:2Issues:0

nbepa1-socg

NetLogo model designed to analyze the nBEPA1 (noisy Best Experienced Payoff, test All, 1 trial) protocol in Single Optimum Coordination Games

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:2Issues:0

nbepa1-socg-nw

NetLogo model designed to analyze the nBEPA1 (noisy Best Experienced Payoff, test All, 1 trial) protocol in Single Optimum Coordination Games, played in networks

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:2Issues:0

pair-approximation

Mathematica notebook created to solve the pair approximation for 2x2 symmetric games on regular networks (see chapter III-5 of the book "Agent-based Evolutionary Game Dynamics")

Language:MathematicaLicense:GPL-3.0Stargazers:0Issues:0Issues:0

random-walk

NetLogo model designed to illustrate the usefulness of the theory of Markov chains to analyse computer models.

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:0Issues:0

reinforcement-learning-2x2

NetLogo model where two reinforcement learners play a 2x2 game.

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:0Issues:0

SBR-TCG

Mathematica notebook created to analyze Sampling Best Response (SBR) dynamics in 3-strategy Tacit Coordination Games (TCG)

Language:MathematicaLicense:GPL-3.0Stargazers:0Issues:1Issues:0

schelling-sakoda-refuting-machine

NetLogo implementation of Schelling-Sakoda model of spatial segregation

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:0Issues:0

wc-lr-cournot

NetLogo model designed to analyse the Win-Continue, Lose-Reverse (WC-LR) rule in Cournot oligopolies.

Language:NetLogoLicense:GPL-3.0Stargazers:0Issues:0Issues:0