@article {Valverde2020,
	title = {Boolean Networks and Their Applications in Science and Engineering},
	journal = {Complexity},
	volume = {2020},
	year = {2020},
	pages = {3},
	type = {10.1155/2020/6183798},
	url = {https://doi.org/10.1155/2020/6183798},
	author = {Valverde, Jose C. and Mortveit, Henning S. and Gershenson, Carlos and Shi, Yongtang}
}
@article {Hernandez2019,
	title = {Anger while driving in Mexico City},
	journal = {PLOS ONE},
	volume = {14},
	number = {9},
	year = {2019},
	month = {09},
	pages = {1-20},
	publisher = {Public Library of Science},
	abstract = {This study aims to analyze the level of anger developed by drivers in Mexico City and also understand the behavior that those drivers use to express that anger, using four different survey methods. The first focuses on personal information, the second Driving Anger Expression Inventory (DAX), the third refers to a shorten version of Driving Anger Scale (DAS) and the fourth being the Dula Dangerous Driving Index (DDDI). These have previously been applied and validated in several different countries. The questionnaires were filled out online by 626 drivers. Using the data collected through the online platform, it was possible to identify the kind of reactions volunteers displayed while driving. Also, it was possible to identify that people in Mexico City developed anger depending on their driving area. Our analyses shows that in the Adaptive/Constructive Expression subscale, males and females show a significant difference in their mean score, with women express their anger in a more constructive way than males.},
	doi = {10.1371/journal.pone.0223048},
	url = {https://doi.org/10.1371/journal.pone.0223048},
	author = {Hern{\'a}ndez-Hern{\'a}ndez, Ana Mar{\'\i}a and Siqueiros-Garc{\'\i}a, Jes{\'u}s M. and Robles-Belmont, Eduardo and Gershenson, Carlos}
}
@unpublished {CxExplicada2019,
	title = {Complejidad Explicada},
	year = {2019},
	note = {Traducci{\'o}n de {\textquoteleft}{\textquoteleft}Complexity Explained{\textquoteright}{\textquoteright}},
	url = {https://complexityexplained.github.io},
	author = {Valerie C. Valerio Holgu{\'\i}n and Carlos Gershenson and Jos{\'e} Luis Herrera and Johann H. Mart{\'\i}nez and Manuel Rueda Santos and Oliver L{\'o}pez Corona and Guillermo de Anda J{\'a}uregui and Gerardo I{\~n}iguez and Alfredo J. Morales Guzm{\'a}n and Jos{\'e} R. Nicol{\'a}s Carlock}
}
@unpublished {ComplexityExplained,
	title = {Complexity Explained: A Grassroot Collaborative Initiative to Create a Set of Essential Concepts of Complex Systems.},
	year = {2019},
	note = {https://complexityexplained.github.io},
	abstract = {Complexity science, also called complex systems science, studies how a large collection of components {\textendash} locally interacting with each other at small scales {\textendash} can spontaneously self-organize to exhibit non-trivial global structures and behaviors at larger scales, often without external intervention, central authorities or leaders. The properties of the collection may not be understood or predicted from the full knowledge of its constituents alone. Such a collection is called a complex system and it requires new mathematical frameworks and scientific methodologies for its investigation.},
	doi = {10.17605/OSF.IO/TQGNW},
	url = {https://complexityexplained.github.io},
	author = {Manlio De Domenico and Chico Camargo and Carlos Gershenson and Daniel Goldsmith and Sabine Jeschonnek and Lorren Kay and Stefano Nichele and Jos{\'e} Nicol{\'a}s and Thomas Schmickl and Massimo Stella and Josh Brandoff and {\'A}ngel Jos{\'e} Mart{\'\i}nez Salinas and Hiroki Sayama}
}
@article {10.1371/journal.pcbi.1007517,
	title = {Efficient sentinel surveillance strategies for preventing epidemics on networks},
	journal = {PLOS Computational Biology},
	volume = {15},
	number = {11},
	year = {2019},
	month = {11},
	pages = {1-19},
	publisher = {Public Library of Science},
	abstract = {Author summary In a network of individuals susceptible to some infectious disease, what are the best locations to monitor in order to detect the infection before most damage can be done? In this paper we address this question by considering various heuristic strategies for sentinel placement that can potentially be implemented in real-world situations without requiring excessive amounts of computation, or even having perfect data about the structure of the network. We find that strategies that attempt to distribute sentinels over different regions of the network perform best in highly modular or spatially embedded networks, whereas the strategy of targeting the most well connected individuals works best when there is a considerable amount of contact heterogeneity between individuals. Our results may be used as a guideline to help decide when certain strategies should, or should not, be implemented.},
	doi = {10.1371/journal.pcbi.1007517},
	url = {https://doi.org/10.1371/journal.pcbi.1007517},
	author = {Colman, Ewan and Holme, Petter and Sayama, Hiroki and Gershenson, Carlos}
}
@article {Cocho2019,
	title = {Rank-frequency distribution of natural languages: A difference of probabilities approach},
	journal = {Physica A: Statistical Mechanics and its Applications},
	volume = {532},
	year = {2019},
	pages = {121795},
	abstract = {In this paper we investigate the time variation of the rank k of words for six Indo-European languages using the Google Books N-gram Dataset. Based on numerical evidence, we regard k as a random variable whose dynamics may be described by a Fokker{\textendash}Planck equation which we solve analytically. For low ranks the distinct languages behave differently, maybe due to the syntax rules, whereas for k>50 the law of large numbers predominates. We analyze the frequency distribution of words using the data and their adjustment in terms of time-dependent probability density distributions. We find small differences between the data and the fits due to conflicting dynamic mechanisms, but the data show a consistent behavior with our general approach. For the lower ranks the behavior of the data changes among languages presumably, again, due to distinct dynamic mechanisms. We discuss a possible origin of these differences and assess the novel features and limitations of our work.},
	keywords = {Fokker{\textendash}Planck equation, Languages, Master equation, Rank dynamics},
	issn = {0378-4371},
	doi = {10.1016/j.physa.2019.121795},
	url = {https://doi.org/10.1016/j.physa.2019.121795},
	author = {Germinal Cocho and Rosal{\'\i}o F. Rodr{\'\i}guez and Sergio S{\'a}nchez and Jorge Flores and Carlos Pineda and Carlos Gershenson}
}
@article {Siqueiros-Garcia2018,
	title = {ALife and Society: Editorial Introduction to the Artificial Life Conference 2016 Special Issue},
	journal = {Artificial Life},
	volume = {24},
	year = {2018},
	pages = {1{\textendash}4},
	publisher = {MIT Press},
	isbn = {1064-5462},
	doi = {10.1162/ARTL_e_00256},
	url = {https://doi.org/10.1162/ARTL_e_00256},
	author = {Siqueiros-Garc{\'\i}a, Jes{\'u}s M. and Froese, Tom and Gershenson, Carlos and Aguilar, Wendy and Sayama, Hiroki and Izquierdo, Eduardo}
}
@article {Pina-Garcia2018,
	title = {From neuroscience to computer science: a topical approach on Twitter},
	journal = {Journal of Computational Social Science},
	volume = {1},
	number = {1},
	year = {2018},
	pages = {187{\textendash}208},
	abstract = {Twitter is perhaps the most influential microblogging service, with 271 million regular users producing approximately 500 million tweets per day. Previous studies of tweets discussing scientific topics are limited to local surveys or may not be representative geographically. This indicates a need to harvest and analyse tweets with the aim of understanding the level of dissemination of science related topics worldwide. In this study, we use Twitter as case of study and explore the hypothesis of science popularization via the social stream. We present and discuss tweets related to popular science around the world using eleven keywords. We analyze a sample of 306,163 tweets posted by 91,557 users with the aim of identifying tweets and those categories formed around temporally similar topics. We systematically examined the data to track and analyze the online activity around users tweeting about popular science. In addition, we identify locations of high Twitter activity that occur in several places around the world. We also examine which sources (mobile devices, apps, and other social networks) are used to share popular science related links. Furthermore, this study provides insights into the geographic density of popular science tweets worldwide. We show that emergent topics related to popular science are important because they could help to explore how science becomes of public interest. The study also offers some important insights for studying the type of scientific content that users are more likely to tweet.},
	isbn = {2432-2725},
	doi = {10.1007/s42001-017-0002-9},
	url = {https://doi.org/10.1007/s42001-017-0002-9},
	author = {Pi{\~n}a-Garc{\'\i}a, C. A. and Siqueiros-Garc{\'\i}a, J. Mario and Robles-Belmont, E. and Carre{\'o}n, Gustavo and Gershenson, Carlos and L{\'o}pez, Julio Amador D{\'\i}az}
}
@article {10.3389/fphy.2018.00045,
	title = {Rank Dynamics of Word Usage at Multiple Scales},
	journal = {Frontiers in Physics},
	volume = {6},
	year = {2018},
	pages = {45},
	abstract = {The recent dramatic increase in online data availability has allowed researchers to explore human culture with unprecedented detail, such as the growth and diversification of language. In particular, it provides statistical tools to explore whether word use is similar across languages, and if so, whether these generic features appear at different scales of language structure. Here we use the Google Books $N$-grams dataset to analyze the temporal evolution of word usage in several languages. We apply measures proposed recently to study rank dynamics, such as the diversity of $N$-grams in a given rank, the probability that an $N$-gram changes rank between successive time intervals, the rank entropy, and the rank complexity. Using different methods, results show that there are generic properties for different languages at different scales, such as a core of words necessary to minimally understand a language. We also propose a null model to explore the relevance of linguistic structure across multiple scales, concluding that $N$-gram statistics cannot be reduced to word statistics. We expect our results to be useful in improving text prediction algorithms, as well as in shedding light on the large-scale features of language use, beyond linguistic and cultural differences across human populations.},
	issn = {2296-424X},
	doi = {10.3389/fphy.2018.00045},
	url = {https://www.frontiersin.org/article/10.3389/fphy.2018.00045},
	author = {Morales, Jos{\'e} A. and Colman, Ewan and S{\'a}nchez, Sergio and S{\'a}nchez-Puig, Fernanda and Pineda, Carlos and I{\~n}iguez, Gerardo and Cocho, Germinal and Flores, Jorge and Gershenson, Carlos}
}
@inbook {GershensonALife2018,
	title = {Self-Organization and Artificial Life: A Review},
	booktitle = {The 2018 Conference on Artificial Life: A Hybrid of the European Conference on Artificial Life (ECAL) and the International Conference on the Synthesis and Simulation of Living Systems (ALIFE)},
	year = {2018},
	pages = {510{\textendash}517},
	publisher = {MIT Press},
	organization = {MIT Press},
	address = {Tokyo, Japan},
	abstract = {Self-organization has been an important concept within a number of disciplines, which Artificial Life (ALife) also has heavily utilized since its inception. The term and its implications, however, are often confusing or misinterpreted. In this work, we provide a mini-review of self-organization and its relationship with ALife, aiming at initiating discussions on this important topic with the interested audience. We first articulate some fundamental aspects of self-organization, outline its usage, and review its applications to ALife within its soft, hard, and wet domains. We also provide perspectives for further research.},
	doi = {10.1162/isal_a_00094},
	url = {https://www.mitpressjournals.org/doi/abs/10.1162/isal_a_00094},
	author = {Gershenson, Carlos and Trianni, Vito and Werfel, Justin and Sayama, Hiroki},
	editor = {Takashi Ikegami and Nathaniel Virgo and Olaf Witkowski and Mizuki Oka and Reiji Suzuki and Hiroyuki Iizuka}
}
@article {Sanchez2018,
	title = {Trajectory Stability in the Traveling Salesman Problem},
	journal = {Complexity},
	volume = {2018},
	year = {2018},
	pages = {2826082},
	type = {10.1155/2018/2826082},
	abstract = {Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity. We analyze the statistical properties of rank distributions and rank dynamics and give evidence that the shortest and longest trajectories are more predictable and robust to change, that is, more stable.},
	url = {https://doi.org/10.1155/2018/2826082},
	author = {S{\'a}nchez, Sergio and Cocho, Germinal and Flores, Jorge and Gershenson, Carlos and I{\~n}iguez, Gerardo and Pineda, Carlos}
}
@article {10.3389/frobt.2017.00010,
	title = {A Package for Measuring Emergence, Self-organization, and Complexity Based on Shannon Entropy},
	journal = {Frontiers in Robotics and AI},
	volume = {4},
	year = {2017},
	pages = {10},
	abstract = {We present Matlab/Octave functions to calculate measures of emergence, self-organization, and complexity of discrete and continuous data. The measures are based on Shannon{\textquoteright}s information and differential entropy, respectively. Examples from different datasets and probability distributions are used to illustrate the usage of the code.},
	issn = {2296-9144},
	doi = {10.3389/frobt.2017.00010},
	url = {http://journal.frontiersin.org/article/10.3389/frobt.2017.00010},
	author = {Santamar{\'\i}a-Bonfil, Guillermo and Gershenson, Carlos and Fern{\'a}ndez, Nelson}
}
@unpublished {AdaptiveCities,
	title = {Adaptive Cities: A Cybernetic Perspective on Urban Systems},
	year = {2016},
	note = {arXiv preprint 1609.02000},
	url = {https://arxiv.org/abs/1609.02000},
	author = {Carlos Gershenson and Paolo Santi and Carlo Ratti}
}
@article {Pina-Garcia2016,
	title = {Exploring Dynamic Environments Using Stochastic Search Strategies},
	journal = {Research in Computing Science},
	volume = {121},
	year = {2016},
	pages = {43{\textendash}57},
	url = {http://rcs.cic.ipn.mx/2016_121/Exploring\%20Dynamic\%20Environments\%20Using\%20Stochastic\%20Search\%20Strategies.pdf},
	author = {C. A. Pi{\~n}a-Garc{\'\i}a and Dongbing Gu and Carlos Gershenson and J. Mario Siqueiros-Garc{\'\i}a and E. Robles-Belmont}
}
@article {Morales2016,
	title = {Generic temporal features of performance rankings in sports and games},
	journal = {EPJ Data Science},
	volume = {5},
	number = {1},
	year = {2016},
	pages = {33},
	abstract = {Many complex phenomena, from trait selection in biological systems to hierarchy formation in social and economic entities, show signs of competition and heterogeneous performance in the temporal evolution of their components, which may eventually lead to stratified structures such as the worldwide wealth distribution. However, it is still unclear whether the road to hierarchical complexity is determined by the particularities of each phenomena, or if there are generic mechanisms of stratification common to many systems. Human sports and games, with their (varied but simple) rules of competition and measures of performance, serve as an ideal test-bed to look for universal features of hierarchy formation. With this goal in mind, we analyse here the behaviour of performance rankings over time of players and teams for several sports and games, and find statistical regularities in the dynamics of ranks. Specifically the rank diversity, a measure of the number of elements occupying a given rank over a length of time, has the same functional form in sports and games as in languages, another system where competition is determined by the use or disuse of grammatical structures. We use a Gaussian random walk model to reproduce the rank diversity of the studied sports and games. We also discuss the relation between rank diversity and the cumulative rank distribution. Our results support the notion that hierarchical phenomena may be driven by the same underlying mechanisms of rank formation, regardless of the nature of their components. Moreover, such regularities can in principle be used to predict lifetimes of rank occupancy, thus increasing our ability to forecast stratification in the presence of competition.},
	issn = {2193-1127},
	doi = {10.1140/epjds/s13688-016-0096-y},
	url = {http://dx.doi.org/10.1140/epjds/s13688-016-0096-y},
	author = {Morales, Jos{\'e} A. and S{\'a}nchez, Sergio and Flores, Jorge and Pineda, Carlos and Gershenson, Carlos and Cocho, Germinal and Zizumbo, Jer{\'o}nimo and Rodr{\'\i}guez, Rosal{\'\i}o F. and I{\~n}iguez, Gerardo}
}
@inbook {ALifeXVIntro,
	title = {Introduction},
	booktitle = {Proceedings of the Artificial Life Conference 2016},
	year = {2016},
	pages = {3{\textendash}9},
	author = {Tom Froese and J. Mario Siqueiros and Wendy Aguilar and Eduardo J. Izquierdo and Hiroki Sayama and Carlos Gershenson}
}
@article {CxContinuous2016,
	title = {Measuring the Complexity of Continuous Distributions},
	journal = {Entropy},
	volume = {18},
	number = {3},
	year = {2016},
	pages = {72},
	abstract = {We extend previously proposed measures of complexity, emergence, and self-organization to continuous distributions using differential entropy. Given that the measures were based on Shannon{\textquoteright}s information, the novel continuous complexity measures describe how a system{\textquoteright}s predictability changes in terms of the probability distribution parameters. This allows us to calculate the complexity of phenomena for which distributions are known. We find that a broad range of common parameters found in Gaussian and scale-free distributions present high complexity values. We also explore the relationship between our measure of complexity and information adaptation.},
	issn = {1099-4300},
	doi = {10.3390/e18030072},
	url = {http://www.mdpi.com/1099-4300/18/3/72},
	author = {Santamar{\'\i}a-Bonfil, Guillermo and Fern{\'a}ndez, Nelson and Gershenson, Carlos}
}
@book {ALifeXV,
	title = {Proceedings of the Artificial Life Conference 2016},
	series = {Complex Adaptive Systems},
	year = {2016},
	month = {July},
	publisher = {MIT Press},
	organization = {MIT Press},
	address = {Cambridge, MA, USA},
	abstract = {The ALife conferences are the major meeting of the artificial life research community since 1987. For its 15th edition in 2016, it was held in Latin America for the first time, in the Mayan Riviera, Mexico, from July 4 -8. The special them of the conference: How can the synthetic study of living systems contribute to societies: scientifically, technically, and culturally? The goal of the conference theme is to better understand societies with the purpose of using this understanding for a more efficient management and development of social systems.},
	isbn = {9780262339360},
	url = {https://mitpress.mit.edu/books/proceedings-artificial-life-conference-2016},
	editor = {Carlos Gershenson and Tom Froese and Jesus M. Siqueiros and Wendy Aguilar and Eduardo J. Izquierdo and Hiroki Sayama}
}
@article {Pina2016,
	title = {Towards a Standard Sampling Methodology on Online Social Networks: Collecting Global Trends on Twitter},
	journal = {Applied Network Science},
	volume = {1},
	year = {2016},
	pages = {3},
	doi = {10.1007/s41109-016-0004-1},
	url = {http://dx.doi.org/10.1007/s41109-016-0004-1},
	author = {C. A. Pi{\~n}a-Garc{\'\i}a and Carlos Gershenson and J. Mario Siqueiros-Garc{\'\i}a}
}
@article {Cortes2016,
	title = {Traffic Games: Modeling Freeway Traffic with Game Theory},
	journal = {PLOS ONE},
	volume = {11},
	number = {11},
	year = {2016},
	month = {11},
	pages = {1-34},
	publisher = {Public Library of Science},
	abstract = {We apply game theory to a vehicular traffic model to study the effect of driver strategies on traffic flow. The resulting model inherits the realistic dynamics achieved by a two-lane traffic model and aims to incorporate phenomena caused by driver-driver interactions. To achieve this goal, a game-theoretic description of driver interaction was developed. This game-theoretic formalization allows one to model different lane-changing behaviors and to keep track of mobility performance. We simulate the evolution of cooperation, traffic flow, and mobility performance for different modeled behaviors. The analysis of these results indicates a mobility optimization process achieved by drivers{\textquoteright} interactions.},
	doi = {10.1371/journal.pone.0165381},
	url = {http://dx.doi.org/10.1371\%2Fjournal.pone.0165381},
	author = {Cort{\'e}s-Berrueco, Luis E. and Gershenson, Carlos and Stephens, Christopher R.}
}
@article {158,
	title = {Wind speed forecasting for wind farms: A method based on support vector regression},
	journal = {Renewable Energy},
	volume = {85},
	year = {2016},
	month = {1},
	pages = {790{\textendash}809},
	abstract = {In this paper, a hybrid methodology based on Support Vector Regression for wind speed forecasting is proposed. Using the autoregressive model called Time Delay Coordinates, feature selection is performed by the Phase Space Reconstruction procedure. Then, a Support Vector Regression model is trained using univariate wind speed time series. Parameters of Support Vector Regression are tuned by a genetic algorithm. The proposed method is compared against the persistence model, and autoregressive models (AR, ARMA, and ARIMA) tuned by Akaike{\textquoteright}s Information Criterion and Ordinary Least Squares method. The stationary transformation of time series is also evaluated for the proposed method. Using historical wind speed data from the Mexican Wind Energy Technology Center (CERTE) located at La Ventosa, Oaxaca, M{\'e}xico, the accuracy of the proposed forecasting method is evaluated for a whole range of short termforecasting horizons (from 1 to 24 h ahead). Results show that, forecasts made with our method are more accurate for medium (5{\textendash}23 h ahead) short term WSF and WPF than those made with persistence and autoregressive models.},
	keywords = {Genetic algorithms, Non-linear analysis, Phase space reconstruction, Support vector regression, Wind speed forecasting},
	isbn = {0960-1481},
	doi = {http://dx.doi.org/10.1016/j.renene.2015.07.004},
	url = {http://www.sciencedirect.com/science/article/pii/S0960148115301014},
	author = {Santamar{\'\i}a-Bonfil, G. and Reyes-Ballesteros, A. and Gershenson, C.}
}
@article {10.1371/journal.pone.0121898,
	title = {Rank Diversity of Languages: Generic Behavior in Computational Linguistics},
	journal = {PLoS ONE},
	volume = {10},
	number = {4},
	year = {2015},
	month = {04},
	pages = {e0121898},
	publisher = {Public Library of Science},
	abstract = {<p>Statistical studies of languages have focused on the rank-frequency distribution of words. Instead, we introduce here a measure of how word ranks change in time and call this distribution rank diversity. We calculate this diversity for books published in six European languages since 1800, and find that it follows a universal lognormal distribution. Based on the mean and standard deviation associated with the lognormal distribution, we define three different word regimes of languages: {\textquotedblleft}heads{\textquotedblright} consist of words which almost do not change their rank in time, {\textquotedblleft}bodies{\textquotedblright} are words of general use, while {\textquotedblleft}tails{\textquotedblright} are comprised by context-specific words and vary their rank considerably in time. The heads and bodies reflect the size of language cores identified by linguists for basic communication. We propose a Gaussian random walk model which reproduces the rank variation of words in time and thus the diversity. Rank diversity of words can be understood as the result of random variations in rank, where the size of the variation depends on the rank itself. We find that the core size is similar for all languages studied.</p>
},
	doi = {10.1371/journal.pone.0121898},
	url = {http://dx.doi.org/10.1371\%2Fjournal.pone.0121898},
	author = {Cocho, Germinal and Flores, Jorge and Gershenson, Carlos and Pineda, Carlos and S{\'a}nchez, Sergio}
}
@inbook {CortesIWSOS2013,
	title = {Self-organization Promotes the Evolution of Cooperation with Cultural Propagation},
	booktitle = {Self-Organizing Systems},
	series = {Lecture Notes in Computer Science},
	volume = {8221},
	year = {2014},
	pages = {145-150},
	publisher = {Springer},
	organization = {Springer},
	address = {Berlin Heidelberg},
	abstract = {In this paper three computational models for the study of the evolution of cooperation under cultural propagation are studied: Kin Selection, Direct Reciprocity and Indirect Reciprocity. Two analyzes are reported, one comparing their behavior between them and a second one identifying the impact that different parameters have in the model dynamics. The results of these analyzes illustrate how game transitions may occur depending of some parameters within the models and also explain how agents adapt to these transitions by individually choosing their attachment to a cooperative attitude. These parameters regulate how cooperation can self-organize under different circumstances. The emergence of the evolution of cooperation as a result of the agent{\textquoteright}s adapting processes is also discussed.},
	isbn = {978-3-642-54139-1},
	doi = {10.1007/978-3-642-54140-7_13},
	url = {http://dx.doi.org/10.1007/978-3-642-54140-7_13},
	author = {Cort{\'e}s-Berrueco, LuisEnrique and Gershenson, Carlos and Stephens, ChristopherR.},
	editor = {Elmenreich, Wilfried and Dressler, Falko and Loreto, Vittorio}
}
@inbook {Gershenson:2011b,
	title = {Self-organizing urban transportation systems},
	booktitle = {Complexity Theories of Cities Have Come of Age: An Overview with Implications to Urban Planning and Design},
	year = {2012},
	pages = {269-279},
	publisher = {Springer},
	organization = {Springer},
	address = {Berlin Heidelberg},
	abstract = {Urban transportation is a complex phenomenon. Since many agents are constantly interacting in parallel, it is difficult to predict the future state of a transportation system. Because of this, optimization techniques tend to give obsolete solutions, as the problem changes before it can be optimized. An alternative lies in seeking adaptive solutions. This adaptation can be achieved with self-organization. In a self-organizing transportation system, the elements of the system follow local rules to achieve a global solution. Like this, when the problem changes the system can adapt by itself to the new configuration. In this chapter, I will review recent, current, and future work on self-organizing transportation systems. Self-organizing traffic lights have proven to improve traffic flow considerably over traditional methods. In public transportation systems, simple rules are being explored to prevent the "equal headway instability" phenomenon. The methods we have used can be also applied to other urban transportation systems and their generality is discussed.},
	doi = {10.1007/978-3-642-24544-2_15},
	url = {http://arxiv.org/abs/0912.1588},
	author = {Carlos Gershenson},
	editor = {Juval Portugali and Han Meyer and Egbert Stolk and Ekim Tan}
}
@inbook {BalpoGershenson:2010,
	title = {Modular Random {Boolean} Networks},
	booktitle = {{Artificial Life XII} Proceedings of the Twelfth International Conference on the Synthesis and Simulation of Living Systems},
	year = {2010},
	pages = {303-304},
	publisher = {MIT Press},
	organization = {MIT Press},
	address = {Odense, Denmark},
	url = {http://mitpress.mit.edu/books/chapters/0262290758chap56.pdf},
	author = {Rodrigo {Poblanno-Balp} and Carlos Gershenson},
	editor = {Harold Fellermann and Mark D{\"o}rr and Martin M. Hanczyc and Lone Ladegaard Laursen and Sarah Maurer and Daniel Merkle and Pierre-Alain Monnard and Kasper St${\o}$y and Steen Rasmussen}
}
@conference {RodriguezEtAl2007,
	title = {Smartocracy: Social Networks for Collective Decision Making},
	booktitle = {Hawaii International Conference on Systems Science (HICSS)},
	year = {2007},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	abstract = {Smartocracy is a social software system for collec- tive decision making. The system is composed of a social network that links individuals to those they trust to make good decisions and a decision network that links individuals to their voted-on solutions. Such networks allow a variety of algorithms to convert the link choices made by individual participants into specific decision outcomes. Simply interpreting the linkages differently (e.g. ignoring trust links, or using them to weight an individual{\textquoteright}s vote) provides a variety of outcomes fit for different decision making scenarios. This paper will discuss the Smartocracy network data structures, the suite of collective decision making algorithms currently supported, and the results of two collective decisions regarding the design of the system.},
	doi = {10.1109/HICSS.2007.484},
	url = {http://tinyurl.com/ybojp8},
	author = {Rodriguez, Marko A. and Steinbock, Daniel J. and Watkins, Jennifer H. and Gershenson, Carlos and Bollen, Johan and Grey, Victor and deGraf, Brad}
}
@conference {GershensonEtAl2006,
	title = {The Role of Redundancy in the Robustness of Random {Boolean} Networks},
	booktitle = {{Artificial Life X}, Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems.},
	year = {2006},
	pages = {35{\textendash}42},
	publisher = {MIT Press},
	organization = {MIT Press},
	abstract = {Evolution depends on the possibility of successfully exploring fitness landscapes via mutation and recombination. With these search procedures, exploration is difficult in "rugged" fitness landscapes, where small mutations can drastically change functionalities in an organism. Random Boolean networks (RBNs), being general models, can be used to explore theories of how evolution can take place in rugged landscapes; or even change the landscapes. In this paper, we study the effect that redundant nodes have on the robustness of RBNs. Using computer simulations, we have found that the addition of redundant nodes to RBNs increases their robustness. We conjecture that redundancy is a way of "smoothening" fitness landscapes. Therefore, redundancy can facilitate evolutionary searches. However, too much redundancy could reduce the rate of adaptation of an evolutionary process. Our results also provide supporting evidence in favour of Kauffman{\textquoteright}s conjecture (Kauffman, 2000, p.195).},
	url = {http://uk.arxiv.org/abs/nlin.AO/0511018},
	author = {Carlos Gershenson and Stuart A. Kauffman and Ilya Shmulevich},
	editor = {Rocha, L. M. and L. S. Yaeger and M. A. Bedau and D. Floreano and R. L. Goldstone and A. Vespignani}
}
@conference {Gershenson2004c,
	title = {Introduction to Random {Boolean} Networks},
	booktitle = {Workshop and Tutorial Proceedings, Ninth International Conference on the Simulation and Synthesis of Living Systems {(ALife} {IX)}},
	year = {2004},
	pages = {160{\textendash}173},
	address = {Boston, MA},
	abstract = {The goal of this tutorial is to promote interest in the study of random Boolean networks (RBNs). These can be very interesting models, since one does not have to assume any functionality or particular connectivity of the networks to study their generic properties. Like this, RBNs have been used for exploring the configurations where life could emerge. The fact that RBNs are a generalization of cellular automata makes their research a very important topic. The tutorial, intended for a broad audience, presents the state of the art in RBNs, spanning over several lines of research carried out by different groups. We focus on research done within artificial life, as we cannot exhaust the abundant research done over the decades related to RBNs.},
	url = {http://arxiv.org/abs/nlin.AO/0408006},
	author = {Carlos Gershenson},
	editor = {M. Bedau and P. Husbands and T. Hutton and S. Kumar and H. Suzuki}
}
@conference {Gershenson2002e,
	title = {Classification of Random {Boolean} Networks},
	booktitle = {Artificial Life {VIII}: Proceedings of the Eight International Conference on Artificial Life},
	year = {2002},
	pages = {1{\textendash}8},
	publisher = {MIT Press},
	organization = {MIT Press},
	address = {Cambridge, MA, USA},
	abstract = {We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism of their updating scheme. For doing so, we first define three new types of RBNs. We note some similarities and differences between different types of RBNs with the aid of a public software laboratory we developed. Particularly, we find that the point attractors are independent of the updating scheme, and that RBNs are more different depending on their determinism or non-determinism rather than depending on their synchronicity or asynchronicity. We also show a way of mapping non-synchronous deterministic RBNs into synchronous RBNs. Our results are important for justifying the use of specific types of RBNs for modelling natural phenomena.},
	url = {http://arxiv.org/abs/cs/0208001},
	author = {Carlos Gershenson},
	editor = {Standish, R. K. and M. A. Bedau and H. A. Abbass}
}
@conference {Gershenson2001b,
	title = {Comments to Neutrosophy},
	booktitle = {Proceedings of the First International Conference on Neutrosophy, Neutrosophic Logic, Set, Probability and Statistics},
	year = {2001},
	pages = {139{\textendash}146},
	publisher = {Xiquan},
	organization = {Xiquan},
	address = {University of New Mexico, Gallup, NM},
	abstract = {Any system based on axioms is incomplete because the axioms cannot be proven from the system, just believed. But one system can be less-incomplete than other. Neutrosophy is less-incomplete than many other systems because it contains them. But this does not mean that it is finished, and it can always be improved. The comments presented here are an attempt to make Neutrosophy even less-incomplete. I argue that less-incomplete ideas are more useful, since we cannot perceive truth or falsity or indeterminacy independently of a context, and are therefore relative. Absolute being and relative being are defined. Also the "silly theorem problem" is posed, and its partial solution described. The issues arising from the incompleteness of our contexts are presented. We also note the relativity and dependance of logic to a context. We propose "metacontextuality" as a paradigm for containing as many contexts as we can, in order to be less-incomplete and discuss some possible consequences.},
	url = {http://uk.arxiv.org/abs/math.GM/0111237},
	author = {Carlos Gershenson},
	editor = {Florentin Smarandache}
}
@conference {GershensonEtAl2000a,
	title = {Action Selection Properties in a Software Simulated Agent},
	booktitle = {{MICAI} 2000: Advances in Artificial Intelligence},
	series = {Lecture Notes in Artificial Intelligence},
	volume = {1793},
	year = {2000},
	pages = {634{\textendash}648},
	publisher = {Springer, Verlag},
	organization = {Springer, Verlag},
	address = {Acapulco, M{\'e}xico},
	abstract = {This article analyses the properties of the Internal Behaviour network, an action selection mechanism previously proposed by the authors, with the aid of a simulation developed for such ends. A brief review of the Internal Behaviour network is followed by the explanation of the implementation of the simulation. Then, experiments are presented and discussed analysing the properties of the action selection in the proposed model.},
	url = {http://uk.arxiv.org/abs/cs.AI/0211039},
	author = {C. Gershenson and P. P. Gonz{\'a}lez and J. Negrete},
	editor = {{O. Cair{\'o} and L. E. S{\'u}car, F.J. Cant{\'u}}
}
@conference {GonzalezEtAl2000a,
	title = {A Model for Combination of External and Internal Stimuli in the Action Selection of an Autonomous Agent},
	booktitle = {{MICAI} 2000: Advances in Artificial Intelligence},
	series = {Lecture Notes in Artificial Intelligence},
	volume = {1793},
	year = {2000},
	pages = {621{\textendash}633},
	publisher = {Springer, Verlag},
	organization = {Springer, Verlag},
	address = {Acapulco, M{\'e}xico},
	abstract = {This paper proposes a model for combination of external and internal stimuli for the action selection in an autonomous agent, based in an action selection mechanism previously proposed by the authors. This combination model includes additive and multiplicative elements, which allows to incorporate new properties, which enhance the action selection. A given parameter a, which is part of the proposed model, allows to regulate the degree of dependence of the observed external behaviour from the internal states of the entity.},
	url = {http://uk.arxiv.org/abs/cs.AI/0211040},
	author = {P. P. Gonz{\'a}lez and J. Negrete and A. Barreiro and C. Gershenson.},
	editor = {{O. Cair{\'o} and L. E. S{\'u}car, F.J. Cant{\'u}}
}
