3 research outputs found
Advances in Computational Social Science and Social Simulation
Aquesta conferència és la celebració conjunta de la "10th Artificial Economics Conference AE", la "10th Conference of the European Social Simulation Association ESSA" i la "1st Simulating the Past to Understand Human History SPUHH".Conferència organitzada pel Laboratory for Socio-Historical Dynamics Simulation (LSDS-UAB) de la Universitat Autònoma de Barcelona.Readers will find results of recent research on computational social science and social simulation economics, management, sociology,and history written by leading experts in the field. SOCIAL SIMULATION (former ESSA) conferences constitute annual events which serve as an international platform for the exchange of ideas and discussion of cutting edge research in the field of social simulations, both from the theoretical as well as applied perspective, and the 2014 edition benefits from the cross-fertilization of three different research communities into one single event. The volume consists of 122 articles, corresponding to most of the contributions to the conferences, in three different formats: short abstracts (presentation of work-in-progress research), posters (presentation of models and results), and full papers (presentation of social simulation research including results and discussion). The compilation is completed with indexing lists to help finding articles by title, author and thematic content. We are convinced that this book will serve interested readers as a useful compendium which presents in a nutshell the most recent advances at the frontiers of computational social sciences and social simulation researc
Hierarchies of local monotonicities and lattice derivatives for Boolean and pseudo-Boolean functions
In this paper we report recent results in [1] concerning local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if each of its partial derivatives keeps the same sign on tuples which differ on less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are tightly related to lattice counterparts of classical partial derivatives via the notion of permutable derivatives. More precisely, p-locally monotone functions have p-permutable lattice derivatives and, in the case of symmetric functions, these two notions coincide. We provide further results relating these two notions, and present a classification of p-locally monotone functions, as well as of functions having p-permutable derivatives, in terms of certain forbidden “sections”, i.e., functions which can be obtained by substituting variables for constants. This description is made explicit in the special case when p=2
Locally monotone Boolean and pseudo-Boolean functions
We propose local versions of monotonicity for Boolean and pseudo-Boolean
functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone
if none of its partial derivatives changes in sign on tuples which differ in
less than p positions. As it turns out, this parameterized notion provides a
hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local
monotonicities are shown to be tightly related to lattice counterparts of
classical partial derivatives via the notion of permutable derivatives. More
precisely, p-locally monotone functions are shown to have p-permutable lattice
derivatives and, in the case of symmetric functions, these two notions
coincide. We provide further results relating these two notions, and present a
classification of p-locally monotone functions, as well as of functions having
p-permutable derivatives, in terms of certain forbidden "sections", i.e.,
functions which can be obtained by substituting constants for variables. This
description is made explicit in the special case when p=2