The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We introduce a new method to perform the partitioning of non-centralized dynamical linear systems based on the relevance of the possible interconnections among the smallest components of the system. In particular, we analyze the importance of the interconnections using game theoretical tools, so that they can be arranged as a function of their expected contribution to the overall system performance...
Although the collection of player and ball tracking data is fast becoming the norm in professional sports, large-scale mining of such spatiotemporal data has yet to surface. In this paper, given an entire season's worth of player and ball tracking data from a professional soccer league (≈400,000,000 data points), we present a method which can conduct both individual player and team...
To endow virtual agents with more realistic affective behavior, the notion of expectation-based emotions plays an important role: emotional states of agents should not only be triggered by present stimuli, but also by anticipation on future stimuli, and evaluation of past stimuli in the context of these anticipations. Within this study, an extension of the belief-desire-intention (BDI) model with...
This paper proposes the use of local context as a way to semantic information retrieval. In our model, rather than trying to formalize the contents of the documents among which the search is done (e.g. by formally annotating them), we try to automatically build a representation of the context in which the search is done. We consider that search is always done as part of an activity, and that the search...
In the two strategy majority/minority game on a network, at time t, an individual observes some subset of its neighbors strategies, and then adopts at time t+1 that strategy which was more/less frequently played by its neighbors at time t. We shall examine in this paper a variety of distinct models which vary the subsets observed, the synchrony of actions, the regularity, or otherwise, of the networks,...
In this paper we analyze a class of n-person supermodular games that arise in the context of interdependent security analysis. More specifically, we quantify the number and the distribution of Nash equilibria in pure strategies and their impact on the tipping set.
In this paper we consider an extension to the classical definition of congestion games (CG) in which multiple users share the same set of resources and their payoff for using any resource is a function of the total number of users sharing it. The classical congestion games enjoy some very appealing properties, including the existence of a Nash equilibrium and that every improvement path is finite...
This article proposes an evaluation methodology for supporting the development of specified learning activities in virtual worlds, based upon inductive methods and augmented by the four dimensional framework. The study undertaken aimed to test the efficacy of the evaluation methodology and to evaluate the broader uses of Second Life for supporting lifelong learners in their educational choices and...
Pervasive applications are featured by their transient interactions, explicit surrounding contexts and by the flow of activities. Towards transparently tackling these features yet rigorously modelling and validating such applications, this contribution capitalizes on SE advances: (1) explicit separation of concerns (e.g. interaction-centric functionalities and context-awareness); (2) flexible description...
General Game Playing (GGP) aims at developing game playing agents that are able to play a variety of games and in the absence of game specific knowledge, become proficient players. Most GGP players have used standard tree-search techniques enhanced by automatic heuristic learning. In this paper we explore knowledge representation and learning in GGP using Reinforcement Learning and Ant Colony Algorithms...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.