@proceedings {185,
	title = {On two information-theoretic measures of random fuzzy networks},
	volume = {32},
	year = {2020},
	month = {2020/07/27},
	pages = {623{\textendash}625},
	doi = {10.1162/isal_a_00342},
	url = {https://www.mitpressjournals.org/doi/abs/10.1162/isal_a_00342},
	author = {Zapata, Octavio and Kim, Hyobin and Gershenson, Carlos}
}
@proceedings {211,
	title = {El S{\'\i}ndrome de los Datos Ricos e Informaci{\'o}n Pobre en Deportes de Competici{\'o}n: Perspectiva desde las Ciencias Computacionales y Ciencia de Datos},
	year = {2019},
	address = {Pachuca, M{\'e}xico},
	abstract = {La gran capacidad existente de capturar datos, conlleva la subsecuente responsabilidad de producir informaci{\'o}n confiable, verificable y auditable para la toma de decisiones. En el futbol, la existencia de compa{\~n}{\'\i}as y plataformas con capacidad de medir un sinn{\'u}mero de variables de desempe{\~n}o, ha generado una explosi{\'o}n de datos de dif{\'\i}cil interpretaci{\'o}n. En este sentido, las dificultades relativas al an{\'a}lisis y visualizaci{\'o}n de estos datos, ha derivado en el {\textquotedblleft}S{\'\i}ndrome de los datos ricos e informaci{\'o}n pobre{\textquotedblright}. En este contexto, esta pl{\'a}tica se centra en evaluar las lecciones aprendidas y las perspectivas futuras en el manejo de datos en el futbol, desde una perspectiva computacional y de ciencia de datos. Nuestro enfoque metodol{\'o}gico, parte de la evaluaci{\'o}n de los formatos en que se produce los datos y los tipos de reportes generados para distintos tipos de usuarios. Planteamos una forma adecuada de manejar e interpretar m{\'u}ltiples variables con soporte en t{\'e}cnicas de aprendizaje autom{\'a}tico, con t{\'e}cnicas de ordenaci{\'o}n y clasificaci{\'o}n para discriminar los factores y variables que tienen mayor contribuci{\'o}n en el juego. Finalmente, brindamos informaci{\'o}n sobre perspectivas novedosas para el modelado de los eventos espacio-temporales, que tienen lugar en los partidos, como la aplicaci{\'o}n desde la ciencia de redes, redes de latencia y modelos de gravitaci{\'o}n para el modelado. Nuestra perspectiva computacional y de ciencia de datos brinda la posibilidad de mejores visualizaciones, con el prop{\'o}sito de simplificar el gran n{\'u}mero de dimensiones y categor{\'\i}as que se inspeccionan en el futbol. De esta forma, nos enfocamos en las interacciones relevantes del juego, que dar{\'\i}an soporte a una mejor toma de decisiones por parte de distintos tipos de usuarios, como jugadores, entrenadores y directivos.},
	author = {Nelson Fern{\'a}ndez and Mart{\'\i}n Zumaya and Carlos Gershenson}
}
@unpublished {SAT2019,
	title = {Evasi{\'o}n en IVA: An{\'a}lisis de redes},
	year = {2019},
	note = {Estudio contratado por el SAT},
	url = {http://omawww.sat.gob.mx/gobmxtransparencia/Paginas/documentos/estudio_opiniones/Evasion_en_IVA_Analisis_de_Redes.pdf},
	author = {Carlos Gershenson and Gerardo I{\~n}iguez and Carlos Pineda and Rita Guerrero and Eduardo Islas and Omar Pineda and Mart{\'\i}n Zumaya}
}
@article {Gonzalez2019,
	title = {A robustness approach to the distributed management of traffic intersections},
	journal = {Journal of Ambient Intelligence and Humanized Computing},
	year = {2019},
	abstract = {Nowadays, the development of autonomous vehicles has emerged as an approach to considerably improve the traffic management in urban zones. Thanks to automation in vehicles as well as in other sectors, the probability of errors, typically due to repetitive tasks, has been drastically reduced. Therefore, technological aids in current driving systems are aimed to avoid or reduce human errors like imprudences or distractions. According to this, it is possible to tackle complex scenarios such as the automation of the vehicles traffic at intersections, as this is one of the points with the highest probability of accidents. In this sense, the coordination of autonomous vehicles at intersections is a trending topic. In the last few years, several approaches have been proposed using centralized solutions. However, centralized systems for traffic coordination have a limited fault-tolerance. This paper proposes a distributed coordination management system for intersections of autonomous vehicles through the employment of some well-defined rules to be followed by vehicles. To validate our proposal, we have developed different experiments in order to compare our proposal with other centralized approaches. Furthermore, we have incorporated the management of communication faults during the execution in our proposal. This improvement has also been tested in front of centralized or semi-centralized solutions. The introduction of failures in the communication process demonstrates the sensitivity of the system to possible disturbances, providing a satisfactory coordination of vehicles during the intersection. As final result, our proposal is kept with a suitable flow of autonomous vehicles still with a high communication fails rate.},
	isbn = {1868-5145},
	doi = {10.1007/s12652-019-01424-w},
	url = {https://doi.org/10.1007/s12652-019-01424-w},
	author = {Gonz{\'a}lez, Cesar L. and Zapotecatl, Jorge L. and Gershenson, Carlos and Alberola, Juan M. and Julian, Vicente}
}
@article {Zapotecatl2017,
	title = {Deliberative Self-Organizing Traffic Lights with Elementary Cellular Automata},
	journal = {Complexity},
	volume = {2017},
	year = {2017},
	pages = {7691370},
	abstract = {Self-organizing traffic lights have shown considerable improvements compared to traditional methods in computer simulations. Self-organizing methods, however, use sophisticated sensors, increasing their cost and limiting their deployment. We propose a novel approach using simple sensors to achieve self-organizing traffic light coordination. The proposed approach involves placing a computer and a presence sensor at the beginning of each block; each such sensor detects a single vehicle. Each computer builds a virtual environment simulating vehicle movement to predict arrivals and departures at the downstream intersection. At each intersection, a computer receives information across a data network from the computers of the neighboring blocks and runs a self-organizing method to control traffic lights. Our simulations showed a superior performance for our approach compared with a traditional method (a green wave) and a similar performance (close to optimal) compared with a self-organizing method using sophisticated sensors but at a lower cost. Moreover, the developed sensing approach exhibited greater robustness against sensor failures.},
	doi = {10.1155/2017/7691370},
	url = {https://doi.org/10.1155/2017/7691370/7691370},
	author = {Zapotecatl, Jorge L. and Rosenblueth, David A. and Gershenson, Carlos}
}
@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 {Zapotecatl2016,
	title = {Performance Metrics of Collective Coordinated Motion in Flocks},
	booktitle = {Proceedings of the Artificial Life Conference 2016},
	year = {2016},
	pages = {322{\textendash}329},
	author = {Jorge L. Zapotecatl and Ang{\'e}lica Mu{\~n}oz-Mel{\'e}ndez and Carlos Gershenson}
}
@article {Zubillaga2014Measuring-the-C,
	title = {Measuring the Complexity of Self-organizing Traffic Lights},
	journal = {Entropy},
	volume = {16},
	number = {5},
	year = {2014},
	pages = {2384{\textendash}2407},
	abstract = {We apply measures of complexity, emergence, and self-organization to an urban traffic model for comparing a traditional traffic-light coordination method with a self-organizing method in two scenarios: cyclic boundaries and non-orientable boundaries. We show that the measures are useful to identify and characterize different dynamical phases. It becomes clear that different operation regimes are required for different traffic demands. Thus, not only is traffic a non-stationary problem, requiring controllers to adapt constantly; controllers must also change drastically the complexity of their behavior depending on the demand. Based on our measures and extending Ashby{\textquoteright}s law of requisite variety, we can say that the self-organizing method achieves an adaptability level comparable to that of a living system.},
	doi = {10.3390/e16052384},
	url = {http://dx.doi.org/10.3390/e16052384},
	author = {Dar{\'\i}o Zubillaga and Geovany Cruz and Luis Daniel Aguilar and Jorge Zapot{\'e}catl and Nelson Fern{\'a}ndez and Jos{\'e} Aguilar and David A. Rosenblueth and Carlos Gershenson}
}
@article {Zenil:2012,
	title = {Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments},
	journal = {Entropy},
	volume = {14},
	number = {11},
	year = {2012},
	pages = {2173{\textendash}2191},
	abstract = {In evolutionary biology, attention to the relationship between stochastic organisms and their stochastic environments has leaned towards the adaptability and learning capabilities of the organisms rather than toward the properties of the environment. This article is devoted to the algorithmic aspects of the environment and its interaction with living organisms. We ask whether one may use the fact of the existence of life to establish how far nature is removed from algorithmic randomness. The paper uses a novel approach to behavioral evolutionary questions, using tools drawn from information theory, algorithmic complexity and the thermodynamics of computation to support an intuitive assumption about the near optimal structure of a physical environment that would prove conducive to the evolution and survival of organisms, and sketches the potential of these tools, at present alien to biology, that could be used in the future to address different and deeper questions. We contribute to the discussion of the algorithmic structure of natural environments and provide statistical and computational arguments for the intuitive claim that living systems would not be able to survive in completely unpredictable environments, even if adaptable and equipped with storage and learning capabilities by natural selection (brain memory or DNA).},
	issn = {1099-4300},
	doi = {10.3390/e14112173},
	url = {http://www.mdpi.com/1099-4300/14/11/2173},
	author = {Zenil, Hector and Gershenson, Carlos and Marshall, James A. R. and Rosenblueth, David A.}
}
@conference {GershensonEtAl2003a,
	title = {Contextual Random {Boolean} Networks},
	booktitle = {Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801},
	year = {2003},
	pages = {615{\textendash}624},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	abstract = {We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks (Gershenson, 2002) as models of contextual deterministic discrete dynamical systems. We show that changes in the context have drastic effects on the global properties of the same networks, namely the average number of attractors and the average percentage of states in attractors. We introduce the situation where we lack knowledge on the context as a more realistic model for contextual dynamical systems. We notice that this makes the network non-deterministic in a specific way, namely introducing a non-Kolmogorovian quantum-like structure for the modelling of the network (Aerts 1986). In this case, for example, a state of the network has the potentiality (probability) of collapsing into different attractors, depending on the specific form of lack of knowledge on the context.},
	url = {http://uk.arxiv.org/abs/nlin.AO/0303021},
	author = {Carlos Gershenson and Jan Broekaert and Diederik Aerts},
	editor = {Banzhaf, W and T. Christaller and P. Dittrich and J. T. Kim and J. Ziegler}
}
@conference {GershensonHeylighen2003a,
	title = {When Can We Call a System Self-Organizing?},
	booktitle = {Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801},
	year = {2003},
	pages = {606{\textendash}614},
	publisher = {Springer},
	organization = {Springer},
	address = {Berlin},
	abstract = {We do not attempt to provide yet another definition of self-organizing systems, nor review previous definitions. We explore the conditions necessary to describe self-organizing systems, inspired on decades of their study, in order to understand them better. These involve the dynamics of the system, and the purpose, boundaries, and description level chosen by an observer. We show how, changing the level or {\textquoteleft}{\textquoteleft}graining{\textquoteright}{\textquoteright} of description, the same system can be self-organizing or not. We also discuss common problems we face when studying self-organizing systems. We analyse when building, designing, and controlling artificial self-organizing systems is useful. We state that self-organization is a way of observing systems, not a class of systems.},
	url = {http://arxiv.org/abs/nlin.AO/0303020},
	author = {Carlos Gershenson and Francis Heylighen},
	editor = {Banzhaf, W and T. Christaller and P. Dittrich and J. T. Kim and J. Ziegler}
}
