Tag Archives: collaboration

Items of some interest:

Posted on by

These are my recent Pinboard.in links:

  • Welcome to the Group Pattern Language Project | Group Works

    "This deck of 91 full-colour cards names what skilled facilitators and other participants do to make things work.  The content is more specific than values and less specific than tips and techniques, cutting across existing methodologies with a designer's eye to capture the patterns that repeat.  The deck can be used to plan sesssions, reflect on and debrief them, provide guidance, and share responsibility for making the process go well.  It has the potential to provide a common reference point for practitioners, and serve as a framework and learning tool for those studying the field. "

    via:bkerr collaboration design-patterns tools social-dynamics

  • [1202.0001] Vector-based model of elastic bonds for DEM simulation of solids

    "A new model for computer simulation of solids, composed of bonded particles, is proposed. Vectors rigidly connected with particles are used for description of deformation of a single bond. The expression for potential energy of the bond and corresponding expressions for forces and moments are proposed. Formulas, connecting parameters of the model with longitudinal, shear, bending and torsional stiffnesses of the bond, are derived. It is shown that the model allows to describe any values of the bond stiffnesses exactly. Two different calibration procedures depending on bond length/thickness ratio are proposed. It is shown that parameters of model can be chosen so that under small deformations the bond is equivalent to either Bernoulli-Euler or Timoshenko rod or short cylinder connecting particles. Simple expressions, connecting parameters of V-model with geometrical and mechanical characteristics of the bond, are derived. Computer simulation of dynamical buckling of the straight discrete rod and discrete half-spherical shell is carried out."

    modeling mechanical-systems materials-science computational-methods algorithms nudge-targets

  • [1202.0253] High-speed Flight in an Ergodic Forest

    "Inspired by birds flying through cluttered environments such as dense forests, this paper studies the theoretical foundations of a novel motion planning problem: high-speed navigation through a randomly-generated obstacle field when only the statistics of the obstacle generating process are known a priori. Resembling a planar forest environment, the obstacle generating process is assumed to determine the locations and sizes of disk-shaped obstacles. When this process is ergodic, and under mild technical conditions on the dynamics of the bird, it is shown that the existence of an infinite collision-free trajectory through the forest exhibits a phase transition. On one hand, if the bird flies faster than a certain critical speed, then, with probability one, there is no infinite collision-free trajectory, i.e., the bird will eventually collide with some tree, almost surely, regardless of the planning algorithm governing the bird's motion. On the other hand, if the bird flies slower than this critical speed, then there exists at least one infinite collision-free trajectory, almost surely. Lower and upper bounds on the critical speed are derived for the special case of a homogeneous Poisson forest considering a simple model for the bird's dynamics. For the same case, an equivalent percolation model is provided. Using this model, the phase diagram is approximated in Monte-Carlo simulations. This paper also establishes novel connections between robot motion planning and statistical physics through ergodic theory and percolation theory, which may be of independent interest."

    robotics planning algorithms nudge-targets

  • [1202.0077] An Interacting Particle Model for Clustering Euclidean Datasets

    "In this paper we propose a method based on interacting particle physics, devised for clustering Euclidean datasets without initial constraints or conditions. We model any dataset as an interacting particle system, whose elements correspond to particles that interact through a simplified version of Lennard-Jones potentials. In so doing, mutual attractive interactions allow to identify groups of proximal particles. The main outcome of this modeling task is an adjacency matrix, taken as input by a community detection algorithm aimed to identify different partitions. The underlying conjecture is that, using a multiresolution analysis, the adopted model allows to find the right number of clusters for any given dataset. Experimental results, performed in comparison with a classical clustering algorithm, confirm this assumption."

    clustering data-analysis algorithms nudge-targets distributed-processing

  • [1201.6583] Empowerment for Continuous Agent-Environment Systems

    "This paper develops generalizations of empowerment to continuous states. Empowerment is a recently introduced information-theoretic quantity motivated by hypotheses about the efficiency of the sensorimotor loop in biological organisms, but also from considerations stemming from curiosity-driven learning. Empowemerment measures, for agent-environment systems with stochastic transitions, how much influence an agent has on its environment, but only that influence that can be sensed by the agent sensors. It is an information-theoretic generalization of joint controllability (influence on environment) and observability (measurement by sensors) of the environment by the agent, both controllability and observability being usually defined in control theory as the dimensionality of the control/observation spaces.…"

    agent-based emergent-design robotics engineering-design machine-learning empowerment nudge

  • [1201.6655] Learning Performance of Prediction Markets with Kelly Bettors

    "In evaluating prediction markets (and other crowd-prediction mechanisms), investigators have repeatedly observed a so-called "wisdom of crowds" effect, which roughly says that the average of participants performs much better than the average participant. The market price—an average or at least aggregate of traders' beliefs—offers a better estimate than most any individual trader's opinion. In this paper, we ask a stronger question: how does the market price compare to the best trader's belief, not just the average trader. We measure the market's worst-case log regret, a notion common in machine learning theory. To arrive at a meaningful answer, we need to assume something about how traders behave. We suppose that every trader optimizes according to the Kelly criteria, a strategy that provably maximizes the compound growth of wealth over an (infinite) sequence of market interactions. We show several consequences.…"

    prediction performance-measure agent-based simulation nudge-targets wisdom-of-crowds

  • Curating the kraken « Public Historian

    'This is why “curate” is still a word to conjure by in our culture.  It still promises transformative power.'

    museology pragmatics naming engineering-of-philosophy

  • [1201.5780] Full and Half Gilbert Tessellations with Rectangular Cells

    "We investigate the ray-length distributions for two different rectangular versions of Gilbert's tessellation. In the full rectangular version, lines extend either horizontally (with east- and west-growing rays) or vertically (north- and south-growing rays) from seed points which form a Poisson point process, each ray stopping when another ray is met. In the half rectangular version, east and south growing rays do not interact with west and north rays. For the half rectangular tessellation we compute analytically, via recursion, a series expansion for the ray-length distribution, whilst for the full rectangular version we develop an accurate simulation technique, based in part on the stopping-set theory of Zuyev, to accomplish the same. We demonstrate the remarkable fact that plots of the two distributions appear to be identical when the intensity of seeds in the half model is twice that in the full model. Our paper explores this coincidence mindful of the fact that, for one model, our results are from a simulation (with inherent sampling error).…"

    geometry tiling algorithms generative-art simulation emergence interesting-problem

Items of some interest:

Posted on by

These are my recent Pinboard.in links:

  • [1201.5440] Self-assembly of anisotropic soft particles in two dimensions

    "The self assembly of core-corona discs interacting via anisotropic potentials is investigated using Monte Carlo computer simulations. A minimal interaction potential that incorporates anisotropy in a simple way is introduced. It consists in a core-corona architecture in which the center of the core is shifted with respect to the center of the corona. Anisotropy can thus be tuned by progressively shifting the position of the core. Despite its simplicity, the system self organize in a rich variety of structures including stripes, triangular and rectangular lattices, and unusual plastic crystals. Our results indicate that the amount of anisotropy does not alter the lattice spacing and only influences the type of clustering (stripes, micells, etc.) of the individual particles."

    self-assembly biologically-inspired simulation pattern-formation condensed-matter

  • [1201.5477] Entropy-growth-based model of emotionally charged online dialogues

    "We analyze emotionally annotated massive data from IRC (Internet Relay Chat) and model the dialogues between its participants by assuming that the driving force for the discussion is the entropy growth of emotional probability distribution. This process is claimed to be correlated to the emergence of the power-law distribution of the discussion lengths observed in the dialogues. We perform numerical simulations based on the noticed phenomenon obtaining a good agreement with the real data. Finally, we propose a method to artificially prolong the duration of the discussion that relies on the entropy of emotional probability distribution."

    oh-look-power-laws flame-wars social-dynamics complexology cultural-dynamics

  • [1201.4955] Coordination, Differentiation and Fairness in a population of cooperating agents

    "In a recent paper, we analyzed the self-assembly of a complex cooperation network. The network was shown to approach a state, where every agent invests the same amount of resources. Nevertheless, highly-connected agents arise that extract extra-ordinarily high payoffs while contributing comparably little to any of their cooperations. Here, we investigate a variant of the model, in which highly-connected agents have access to additional resources. We study analytically and numerically whether these resources are invested in existing collaborations, leading to a fairer load distribution, or in establishing new collaborations, leading to an even less fair distribution of loads and payoffs."

    collaboration social-capital agent-based network-theory complexology nudge-targets

  • [1201.5426] Constraint Propagation as Information Maximization

    "Dana Scott used the partial order among partial functions for his mathematical model of recursively defined functions. He interpreted the partial order as one of information content. In this paper we elaborate on Scott's suggestion of regarding computation as a process of information maximization by applying it to the solution of constraint satisfaction problems. Here the method of constraint propagation can be interpreted as decreasing uncertainty about the solution — that is, as gain in information about the solution. As illustrative example we choose numerical constraint satisfaction problems to be solved by interval constraints. To facilitate this approach to constraint solving we formulate constraint satisfaction problems as formulas in predicate logic. This necessitates extending the usual semantics for predicate logic so that meaning is assigned not only to sentences but also to formulas with free variables."

    computer-science quite-interesting constraint-processing computational-methods

  • [1201.4459] An efficient parallel algorithm for the longest path problem in meshes

    "In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. This algorithm can be considered as an improvement of [13]. Then based on this sequential algorithm, we present a constant-time parallel algorithm for the problem which can be run on every parallel machine."

    algorithms graph-theory computational-complexity nudge-targets

  • [1201.4417] Instabilities and Patterns in Coupled Reaction-Diffusion Layers

    "We study instabilities and pattern formation in reaction-diffusion layers that are diffusively coupled. For two-layer systems of identical two-component reactions, we analyze the stability of homogeneous steady states by exploiting the block symmetric structure of the linear problem. There are eight possible primary bifurcation scenarios, including a Turing-Turing bifurcation that involves two disparate length scales whose ratio may be tuned via the inter-layer coupling. For systems of $n$-component layers and non-identical layers, the linear problem's block form allows approximate decomposition into lower-dimensional linear problems if the coupling is sufficiently weak. As an example, we apply these results to a two-layer Brusselator system. The competing length scales engineered within the linear problem are readily apparent in numerical simulations of the full system. Selecting a $sqrt{2}$:1 length scale ratio produces an unusual steady square pattern."

    cute emergent-design pattern-formation complexology nudge-targets nonlinear-dynamics

  • [1201.4737] Production System Rules as Protein Complexes from Genetic Regulatory Networks

    "This short paper introduces a new way by which to design production system rules. An indirect encoding scheme is presented which views such rules as protein complexes produced by the temporal behaviour of an artificial genetic regulatory network. This initial study begins by using a simple Boolean regulatory network to produce traditional ternary-encoded rules before moving to a fuzzy variant to produce real-valued rules. Competitive performance is shown with related genetic regulatory networks and rule-based systems on benchmark problems."

    evolutionary-algorithms production-systems computer-science emergent-design

Items of some interest…

Posted on by

These are my recent Pinboard.in links:

  • Free Ride: Digital Parasites and the Fight for the Business of Culture | Brain Pickings

    "For my part, I started Brain Pickings more than six years ago as what’s commonly referred to as a “passion project” (though I don’t like the fleeting noncommittal relationship this phrasing suggests) and didn’t have a business model — but I did have a crystal-clear editorial model, which remains the same today: get people interested in meaningful cross-disciplinary things they didn’t yet know they were interested in, and in the process empower their networked knowledge and combinatorial creativity; break out of the filter bubble, if you will, though conceived long before we had the very vocabulary to articulate it. So when an aggregator like the Huffington Post, a business-model wolf wearing an editorial-authenticity sheep’s skin, takes my (ad-free) content and regurgitates it on its (ad-plastered) site, it lives up to the term “parasite” at the heart of Levine’s argument, derived from the Greek parasitos and used to describe “someone who ate at someone else’s table without providing anything in return.”"

    publishing disintermediation reintermediation intellectual-property creativity collaboration network-culture

Items of some interest…

Posted on by

These are my recent Pinboard.in links:

  • collision detection: The art of public thinking

    "This year, I’ve had another big load on my time: I’m writing my first book! Thus far it’s called Outsmart: The Future of Thought in the Age of Machines — a title possessed of such purple, sci-fi bombast that even though I wrote it myself, I still crack up every time I say it out loud. As you might imagine, coming from me, the book is a generally optimistic assessment of how digital tools are generating new ways for us to learn things, muse over them, and act on them. But the point is that it’s another time hog: Researching and writing a book has required such nose-to-the-grindstone work — to say nothing of nose-to-the-grindstone procrastination — that it has crowded out whatever time I might have had for blogging. Authors frequently describe the process of book-writing as similar to giving birth to a child, a metaphor I always found faintly icky; but, hey, maybe they were right. I’ve got three kids now, and no blog.

    Yet as I’ve worked away on the book, I’ve increasingly begun to feel intellectually claustrophic. It’s hard to describe, but it’s like a cabin fever of the mind. The symptoms: I’ll get obsessed with a particular line of research, chewing away at it for days or weeks, only to realize it’s a) kind of half-baked or b) super interesting but not at all useful to my work. Or I’ll read a fascinating white paper, write a bunch of notes on it, but never crystallize a solid analysis.

    I now think the problem is I’m not doing enough thinking in public."

    via:tsuomela blogging social-dynamics collaboration release-early-and-often essayism storytelling-is-a-social-process

Items of some interest…

Posted on by

These are my recent Pinboard.in links:

  • [1106.1804] A Critical Assessment of Benchmark Comparison in Planning

    "Recent trends in planning research have led to empirical comparison becoming commonplace. The field has started to settle into a methodology for such comparisons, which for obvious practical reasons requires running a subset of planners on a subset of problems. In this paper, we characterize the methodology and examine eight implicit assumptions about the problems, planners and metrics used in many of these comparisons. The problem assumptions are: PR1) the performance of a general purpose planner should not be penalized/biased if executed on a sampling of problems and domains, PR2) minor syntactic differences in representation do not affect performance, and PR3) problems should be solvable by STRIPS capable planners unless they require ADL. The planner assumptions are: PL1) the latest version of a planner is the best one to use, PL2) default parameter settings approximate good performance, and PL3) time cut-offs do not unduly bias outcome. The metrics assumptions are: M1) performance degrades similarly for each planner when run on degraded runtime environments (e.g., machine platform) and M2) the number of plan steps distinguishes performance. We find that most of these assumptions are not supported empirically; in particular, that planners are affected differently by these assumptions. We conclude with a call to the community to devote research resources to improving the state of the practice and especially to enhancing the available benchmark problems."

    planning benchmarking algorithms horse-races engineering-design operations-research nudge-targets

  • [1108.4361] The relationship between acquaintanceship and coauthorship in scientific collaboration networks

    "This article examines the relationship between acquaintanceship and coauthorship patterns in a multi-disciplinary, multi-institutional, geographically distributed research center. Two social networks are constructed and compared: a network of coauthorship, representing how researchers write articles with one another, and a network of acquaintanceship, representing how those researchers know each other on a personal level, based on their responses to an online survey. Statistical analyses of the topology and community structure of these networks point to the importance of small-scale, local, personal networks predicated upon acquaintanceship for accomplishing collaborative work in scientific communities."

    academic-culture network-theory citation social-networks

  • [1108.4223] The set-theoretic multiverse

    "The multiverse view in set theory, introduced and argued for in this article, is the view that there are many distinct concepts of set, each instantiated in a corresponding set-theoretic universe. The universe view, in contrast, asserts that there is an absolute background set concept, with a corresponding absolute set-theoretic universe in which every set-theoretic question has a definite answer. The multiverse position, I argue, explains our experience with the enormous diversity of set-theoretic possibilities, a phenomenon that challenges the universe view. In particular, I argue that the continuum hypothesis is settled on the multiverse view by our extensive knowledge about how it behaves in the multiverse, and as a result it can no longer be settled in the manner formerly hoped for."

    mathematics mathematical-criticism looking-forward-to-understanding-this-someday pragmatism-it-ain't

  • [1102.1934] The structure of the Arts & Humanities Citation Index: A mapping on the basis of aggregated citations among 1,157 journals

    "Using the Arts & Humanities Citation Index (A&HCI) 2008, we apply mapping techniques previously developed for mapping journal structures in the Science and Social Science Citation Indices. Citation relations among the 110,718 records were aggregated at the level of 1,157 journals specific to the A&HCI, and the journal structures are questioned on whether a cognitive structure can be reconstructed and visualized. Both cosine-normalization (bottom up) and factor analysis (top down) suggest a division into approximately twelve subsets. The relations among these subsets are explored using various visualization techniques. However, we were not able to retrieve this structure using the ISI Subject Categories, including the 25 categories which are specific to the A&HCI. We discuss options for validation such as against the categories of the Humanities Indicators of the American Academy of Arts and Sciences, the panel structure of the European Reference Index for the Humanities (ERIH), and compare our results with the curriculum organization of the Humanities Section of the College of Letters and Sciences of UCLA as an example of institutional organization."

    network-theory citation-networks humanities academic-culture quantitative-humanities

  • [1108.4220] A Dynamical Systems Approach for Static Evaluation in Go

    "In the paper arguments are given why the concept of static evaluation has the potential to be a useful extension to Monte Carlo tree search. A new concept of modeling static evaluation through a dynamical system is introduced and strengths and weaknesses are discussed. The general suitability of this approach is demonstrated."

    representation-theory planning monte-carlo-models nudge algorithms

  • [1105.5449] AntNet: Distributed Stigmergetic Control for Communications Networks

    "…We compare our algorithm with six state-of-the-art routing algorithms coming from the telecommunications and machine learning fields. The algorithms' performance is evaluated over a set of realistic testbeds. We run many experiments over real and artificial IP datagram networks with increasing number of nodes and under several paradigmatic spatial and temporal traffic distributions. Results are very encouraging. AntNet showed superior performance under all the experimental conditions with respect to its competitors. We analyze the main characteristics of the algorithm and try to explain the reasons for its superiority."

    ant-colony-optimization network-theory networks control algorithms nudge-targets routing

  • Bozo Sapiens: Sacco and Vanzetti: Evidence

    "Wigmore’s technique, like probability itself, is both wide-ranging and tediously painstaking; his book was popular only among insomniac judges. But now that computers can take on the numerical drudgery, it is proving its worth in just such tangled cases as Sacco’s and Vanzetti’s. The legal scholars Joseph Kadane and David Schum have applied a sophisticated extension of Wigmore’s method to the vast body of evidence from the case. Theirs is a remarkable achievement; their charts retain all the original complexities: the facts withheld or perverted, the hearsay, the lies told and disavowed on both sides, the charged political atmosphere of eighty years ago. They never discount a fact, no matter how far-fetched; they  simply give it its due weight in their dynamic structure.

    Their conclusion?  Unjust though it is to summarize a book in a sentence, the balance of probability seems to favor the view expressed long ago by one of the defendants’ close companions: “everyone in the Boston anarchistic circle knew that Sacco was guilty and that Vanzetti was innocent as far as the actual participation in the killing.” So, there it is: whichever side our political instincts favor, we are destined to be half wrong.

    Vanzetti’s last words were: "I wish to forgive some people for what they are now doing to me."  If we were all willing to make the extra effort to work out the probabilities, perhaps we might not need forgiveness so often."

    probability-theory legal-studies computational-methods history

  • Getting first sale wrong

    "I hate to imagine it, but this decision raises some frightening possibilities and requires greater vigilance on the part of librarians.  At the very least, libraries must demand information from publishers about where every item has been manufactured. Obtaining such information is no longer an option, since our legal uses of the things we buy now depends on knowing this, and the place where the publisher is located or where the sale took place is simply not sufficient.  But what I really fear is that publishers will begin to manufacture more of their works overseas and then try to demand a higher price – one that includes “public lending rights” – from libraries.

    If libraries are in a difficult position, students may be even worse off under the Second Circuit’s ruling.  Again, publishers now have an incentive to manufacture their textbooks abroad and sell them to U.S. students.  Such students would no longer have the right to re-sell their textbooks or to purchase used texts.  The defendant in the case, Supap Kirtsaeng, had made a lucrative business out of reselling textbooks purchased in Asia.  He was perhaps an unsympathetic party, but what he was doing was not different in kind from the resale of texts that is common on all college campuses.  This activity makes higher education a little more possible for many.  Now publishers have an easy way for to close down this secondary market for textbooks, about which they have complained for years.  In the process, the cost of education for college students would be pushed up even further."

    copyright insanity intellectual-property academic-culture librarians

  • [1106.6037] Black Hole Search with Finite Automata Scattered in a Synchronous Torus

    "We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent visiting that node without leaving any trace. The objective is to locate the black hole without destroying too many agents. This is difficult to achieve when the agents are initially scattered in the network and are unaware of the location of each other. Previous studies for black hole search used more powerful models where the agents had non-constant memory, were labelled with distinct identifiers and could either write messages on the nodes of the network or mark the edges of the network. In contrast, we solve the problem using a small team of finite-state agents each carrying a constant number of identical tokens that could be placed on the nodes of the network. Thus, all resources used in our algorithms are independent of the network size. We restrict our attention to oriented torus networks and first show that no finite team of finite state agents can solve the problem in such networks, when the tokens are not movable. In case the agents are equipped with movable tokens, we determine lower bounds on the number of agents and tokens required for solving the problem in torus networks of arbitrary size. Further, we present a deterministic solution to the black hole search problem for oriented torus networks, using the minimum number of agents and tokens."

    algorithms agent-based multi-agent-systems network-theory nudge-targets

  • [1106.1821] Collective Intelligence, Data Routing and Braess’ Paradox

    "We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system so that they work synergistically to maximize a global utility. The particular problem domain we explore is the control of network routing by placing agents on all the routers in the network. Conventional approaches to this task have the agents all use the Ideal Shortest Path routing Algorithm (ISPA). We demonstrate that in many cases, due to the side-effects of one agent's actions on another agent's performance, having agents use ISPA's is suboptimal as far as global aggregate cost is concerned, even when they are only used to route infinitesimally small amounts of traffic. The utility functions of the individual agents are not "aligned" with the global utility, intuitively speaking. As a particular example of this we present an instance of Braess' paradox in which adding new links to a network whose agents all use the ISPA results in a decrease in overall throughput. We also demonstrate that load-balancing, in which the agents' decisions are collectively made to optimize the global cost incurred by all traffic currently being routed, is suboptimal as far as global cost averaged across time is concerned. This is also due to 'side-effects', in this case of current routing decision on future traffic. The mathematics of Collective Intelligence (COIN) is concerned precisely with the issue of avoiding such deleterious side-effects in multi-agent systems, both over time and space. We present key concepts from that mathematics and use them to derive an algorithm whose ideal version should have better performance than that of having all agents use the ISPA, even in the infinitesimal limit. We present experiments verifying this, and also showing that a machine-learning-based version of this COIN algorithm in which costs are only imprecisely estimated via empirical means (a version potentially applicable in the real world) also outperforms the ISPA, despite having access to less information than does the ISPA. In particular, this COIN algorithm almost always avoids Braess' paradox."

    collective-intelligence search-algorithms figure-ground-error planning nudge

  • [1108.0404] Exploiting Agent and Type Independence in Collaborative Graphical Bayesian Games

    "Efficient collaborative decision making is an important challenge for multiagent systems. Finding optimal joint actions is especially challenging when each agent has only imperfect information about the state of its environment. Such problems can be modeled as collaborative Bayesian games in which each agent receives private information in the form of its type. However, representing and solving such games requires space and computation time exponential in the number of agents. This article introduces collaborative graphical Bayesian games (CGBGs), which facilitate more efficient collaborative decision making by decomposing the global payoff function as the sum of local payoff functions that depend on only a few agents. We propose a framework for the efficient solution of CGBGs based on the insight that they posses two different types of independence, which we call agent independence and type independence. In particular, we present a factor graph representation that captures both forms of independence and thus enables efficient solutions. In addition, we show how this representation can provide leverage in sequential tasks by using it to construct a novel method for decentralized partially observable Markov decision processes. Experimental results in both random and benchmark tasks demonstrate the improved scalability of our methods compared to several existing alternatives."

    collaboration agent-based complex-systems emergent-design nudge-targets

  • [1102.2837] Efficient Promotion Strategies in Hierarchical Organizations

    "The Peter principle has been recently investigated by means of an agent-based simulation and its validity has been numerically corroborated. It has been confirmed that, within certain conditions, it can really influence in a negative way the efficiency of a pyramidal organization adopting meritocratic promotions. It was also found that, in order to bypass these effects, alternative promotion strategies should be adopted, as for example a random selection choice. In this paper, within the same line of research, we study promotion strategies in a more realistic hierarchical and modular organization and we show the robustness of our previous results, extending their validity to a more general context. We discuss also why the adoption of these strategies could be useful for real organizations."

    organizational-behavior complexology complexological-amusements agent-based competence