Altruism in the (Social) Network

This paper explores the role of social integration on altruistic behavior. To this aim, we develop a two-stage experimental protocol based on the classic Dictator Game. In the first stage, we ask a group of 77 undergraduate students in Economics to elicit their social network; in the second stage, each of them has to unilaterally decide over the division of a fixed amount of money to be shared with another anonymous member in the group. Our experimental design allows to control for other variables known to be relevant for altruistic behavior: framing and friendship/acquaintance relations. Consistently with previous research, we find that subjects favor their friends and that framing enhances altruistic behavior. Once we control for these effects, social integration (measured by betweenness, a standard centrality measure in network theory) has a positive effect on giving: the larger social isolation within the group, the more likely it is the emergence of selfish behavior. These results suggest that information on the network structure in which subjects are embedded is crucial to account for their behavior.

Contribution of Resource-Based View and Entrepreneurial Orientation on Small Firm Growth

[EN] This research provides a useful framework for identifying a small firms’ propensity to engage in entrepreneurial orientation. We examine the impact of the Entrepreneurial Orientation (EO) as a main resource and capability on small firm’ growth. The growth seems to come out as an important demonstration of the entrepreneurial orientation of small firms (Davidsson, 1989; Green and Brown, 1997; Janney and Gregory, 2006). Thus, this research builds on prior conceptual research that suggests a positive integration between entrepreneurial orientation and resource-based view. In the first instance, the research will focus on reviewing literature in the emerging area of entrepreneurial orientation as it applies to growth oriented small firms and resource-based view of the firm. Secondly, an empirical study was developed based on a stratified sample of small firms of manufacturing industry. Data were submitted to a multivariate statistical analysis and a linear regression model was performed in order to predict the influence of the resources and capabilities on small firms’ growth. In this sense, we consider the construct growth as a dependent variable and the ones relates with resources and capabilities (entrepreneur resources, firm resources, networks and EO) as independent variables. The research results suggest a set of resources and capabilities that promote the growth of the small firms. Also, the EO seems to have a predictive value on growth. Explaining variables related with resources and capabilities and EO were identified as essential in growth oriented small firms. It was still possible to conclude that the entrepreneurial firms which grew seem to have resources and develop more capabilities and take advantage in the search for those competences. This attitude reflects on the EO of the firm. This study has important implication for both researchers and practitioners. It highlights the necessity of firms to develop superior EO of all their members and also to invest on better resources and consequently superior capabilities as a way of reaching higher levels of growth. While previous authors have attempted to analyse certain aspects of this process (linkage between entrepreneurial orientation and growth), this research developed a framework that combines these and others factors (resource-based view) pertinent to growth oriented small firms. The results support the necessity to identify explicative variables of multiple levels to explain the growth of small firms. The adoption of an entrepreneurial orientation as an indispensable variable to the growth oriented small firms seems pertinent.

Using network mesures to test evolved NK-landscapes

In this paper we empirically investigate which are the structural characteristics that can help to predict the complexity of NK-landscape instances for estimation of distribution algorithms. To this end, we evolve instances that maximize the estimation of distribution algorithm complexity in terms of its success rate. Similarly, instances that minimize the algorithm complexity are evolved. We then identify network measures, computed from the structures of the NK-landscape instances, that have a statistically significant difference between the set of easy and hard instances. The features identified are consistently significant for different values of N and K.

Learning in Network Games

We report the findings of an experiment designed to study how people learn and make decisions in network games. Network games offer new opportunities to identify learning rules, since on networks (compared to e.g. random matching) more rules differ in terms of their information requirements. Our experimental design enables us to observe both which actions participants choose and which information they consult before making their choices. We use this information to estimate learning types using maximum likelihood methods. There is substantial heterogeneity in learning types. However, the vast majority of our participants' decisions are best characterized by reinforcement learning or (myopic) best-response learning. The distribution of learning types seems fairly stable across contexts. Neither network topology nor the position of a player in the network seem to substantially affect the estimated distribution of learning types.

New methods for generating populations in Markov network based EDAs: Decimation strategies and model-based template recombination

Methods for generating a new population are a fundamental component of estimation of distribution algorithms (EDAs). They serve to transfer the information contained in the probabilistic model to the new generated population. In EDAs based on Markov networks, methods for generating new populations usually discard information contained in the model to gain in efficiency. Other methods like Gibbs sampling use information about all interactions in the model but are computationally very costly. In this paper we propose new methods for generating new solutions in EDAs based on Markov networks. We introduce approaches based on inference methods for computing the most probable configurations and model-based template recombination. We show that the application of different variants of inference methods can increase the EDAs’ convergence rate and reduce the number of function evaluations needed to find the optimum of binary and non-binary discrete functions.

Influence of Training Set Selection in Artificial Neural Network-Based Propagation Path Loss Predictions

This paper analyzes the use of artificial neural networks (ANNs) for predicting the received power/path loss in both outdoor and indoor links. The approach followed has been a combined use of ANNs and ray-tracing, the latter allowing the identification and parameterization of the so-called dominant path. A complete description of the process for creating and training an ANN-based model is presented with special emphasis on the training process. More specifically, we will be discussing various techniques to arrive at valid predictions focusing on an optimum selection of the training set. A quantitative analysis based on results from two narrowband measurement campaigns, one outdoors and the other indoors, is also presented.