Search results for "Variable"
showing 10 items of 1674 documents
Contests with size effects
2006
In this paper we analyze the structure of contest equilibria with a variable number of individuals. First we analyze a situation where the total prize depends on the number of agents and where every single agent faces opportunity costs of investing in the contest. Second we analyze a situation where the agents face a trade-off between productive and appropriative investments. Here, the number of agents may also influence the productivity of productive investments. It turns out that both types of contests may lead to opposing results concerning the optimal number of individuals depending on the strength of size effects. Whereas in the former case individual utility is u-shaped when the numbe…
Identifying individuality and variability in team tactics by means of statistical shape analysis and multilayer perceptrons.
2012
Abstract Offensive and defensive systems of play represent important aspects of team sports. They include the players’ positions at certain situations during a match, i.e., when players have to be on specific positions on the court. Patterns of play emerge based on the formations of the players on the court. Recognition of these patterns is important to react adequately and to adjust own strategies to the opponent. Furthermore, the ability to apply variable patterns of play seems to be promising since they make it harder for the opponent to adjust. The purpose of this study is to identify different team tactical patterns in volleyball and to analyze differences in variability. Overall 120 s…
Modeling Spatial Data Pooled over Time: Schematic Representation and Monte Carlo Evidences
2015
The spatial autocorrelation issue is now well established, and it is almost impossible to deal with spatial data without considering this reality. In addition, recent developments have been devoted to developing methods that deal with spatial autocorrelation in panel data. However, little effort has been devoted to dealing with spatial data (cross-section) pooled over time. This paper endeavours to bridge the gap between the theoretical modeling development and the application based on spatial data pooled over time. The paper presents a schematic representation of how spatial links can be expressed, depending on the nature of the variable, when combining the spatial multidirectional relatio…
Extension of The Stochastic Differential Calculus To Complex Processes
1996
In structural engineering complex processes arise to predict the first excursion failure, fatigue failure, etc. Indeed to solve these problems the envelope function, which is the modulus of a complex process, is usually introduced. In this paper the statistics of the complex response process related to the envelope statistics of linear systems subjected to parametric stationary normal white noise input are evaluated by using extensively the properties of stochastic differential calculus.
Exploring chemical reactivity of complex systems with path-based coordinates: role of the distance metric.
2014
Path-based reaction coordinates constitute a valuable tool for free-energy calculations in complex processes. When a reference path is defined by means of collective variables, a nonconstant distance metric that incorporates the nonorthonormality of these variables should be taken into account. In this work, we show that, accounting for the correct metric tensor, these kind of variables can provide iso-hypersurfaces that coincide with the iso-committor surfaces and that activation free energies equal the value that would be obtained if the committor function itself were used as reaction coordinate. The advantages of the incorporation of the variable metric tensor are illustrated with the an…
Synthetic Genes for artificial ants. Diversity in ant colony optimization algorithms
2010
Inspired from the fact that the real world ants from within a colony are not clones (although they may look alike, they are different from one another), in this paper, the authors are presenting an adapted ant colony optimisation (ACO) algorithm that incorporates methods and ideas from genetic algorithms (GA). Following the first (introductory) section of the paper is presented the history and the state of the art, beginning with the stigmergy and genetic concepts and ending with the latest ACO algorithm variants as multiagent systems (MAS). The rationale and the approach sections are aiming at presenting the problems with current stigmergy-based algorithms and at proposing a (possible - ye…
REPEATED GAMES WITH PROBABILISTIC HORIZON
2005
Repeated games with probabilistic horizon are defined as those games where players have a common probability structure over the length of the game's repetition, T. In particular, for each t, they assign a probability pt to the event that "the game ends in period t". In this framework we analyze Generalized Prisoners' Dilemma games in both finite stage and differentiable stage games. Our construction shows that it is possible to reach cooperative equilibria under some conditions on the distribution of the discrete random variable T even if the expected length of the game is finite. More precisely, we completely characterize the existence of sub-game perfect cooperative equilibria in finite s…
Thompson Sampling for Dynamic Multi-armed Bandits
2011
The importance of multi-armed bandit (MAB) problems is on the rise due to their recent application in a large variety of areas such as online advertising, news article selection, wireless networks, and medicinal trials, to name a few. The most common assumption made when solving such MAB problems is that the unknown reward probability theta k of each bandit arm k is fixed. However, this assumption rarely holds in practice simply because real-life problems often involve underlying processes that are dynamically evolving. In this paper, we model problems where reward probabilities theta k are drifting, and introduce a new method called Dynamic Thompson Sampling (DTS) that facilitates Order St…
Automatic construction of test sets: Theoretical approach
2005
We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…
Does Sedentary Behavior Predict Academic Performance in Adolescents or the Other Way Round? A Longitudinal Path Analysis.
2016
This study examined whether adolescents’ time spent on sedentary behaviors (academic, technological-based and social-based activities) was a better predictor of academic performance than the reverse. A cohort of 755 adolescents participated in a three-year period study. Structural Equation Modeling techniques were used to test plausible causal hypotheses. Four competing models were analyzed to determine which model best fitted the data. The Best Model was separately tested by gender. The Best Model showed that academic performance was a better predictor of sedentary behaviors than the other way round. It also indicated that students who obtained excellent academic results were more likely t…