851 resultados para GAMES
Resumo:
Simpósio de Informática (INForum 2015), Covilhã, Portugal. Notes: Best paper award nominee.
Resumo:
Esta dissertação incide sobre o estudo e análise de uma solução para a criação de um sistema de recomendação para uma comunidade de consumidores de media e no consequente desenvolvimento da mesma cujo âmbito inicial engloba consumidores de jogos, filmes e/ou séries, com o intuito de lhes proporcionar a oportunidade de partilharem experiências, bem como manterem um registo das mesmas. Com a informação adquirida, o sistema reúne condições para proceder a sugestões direccionadas a cada membro da comunidade. O sistema actualiza a sua informação mediante as acções e os dados fornecidos pelos membros, bem como pelo seu feedback às sugestões. Esta aprendizagem ao longo do tempo permite que as sugestões do sistema evoluam juntamente com a mudança de preferência dos membros ou se autocorrijam. O sistema toma iniciativa de sugerir mediante determinadas acções, mas também pode ser invocada uma sugestão directamente pelo utilizador, na medida em que este não precisa de esperar por sugestões, podendo pedir ao sistema que as forneça num determinado momento. Nos testes realizados foi possível apurar que o sistema de recomendação desenvolvido forneceu sugestões adequadas a cada utilizador específico, tomando em linha de conta as suas acções prévias. Para além deste facto, o sistema não forneceu qualquer sugestão quando o histórico destas tinha provado incomodar o utilizador.
Resumo:
The ever increasing popularity of social media makes it a promising source for the personalization of gameplay experiences. Furthermore, involving social network friends in a game can greatly enrich the satisfaction of the player and also attract potential novel players to a game. This master thesis describes a social overlay designed for desktop games, called GameNshare. It allows players to easily capture and share with multiple social networks game-related screenshots, videos and stories. Additionally, it also provides asynchronous multiplayer game mechanics to directly integrate social network friends in the game. GameNshare was designed to interact with the users in a non-intrusive way allowing them to be in complete control of what is shared. It prevents unsolicited sharing of messages, a key problem in social media integration tools, by the use of built-in message monitoring and anti-spam measures. GameNshare was specially designed for players aged from 18 to 25 years that are regular users of Twitter and Facebook. It was tested by a group of 10 individuals from the target age range that were surveyed to capture their insights on the use of the social overlay. The implemented GameNshare features were well accepted by the testers that were also useful in highlighting features for future development. GameNshare ultimate goal is to make players look and ask for social integration and allow them to take full advantage of their social communities to improve gaming experiences.
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Informática
Resumo:
We introduce a notion of upper semicontinuity, weak upper semicontinuity, and show that it, together with a weak form of payoff security, is enough to guarantee the existence of Nash equilibria in compact, quasiconcave normal form games. We show that our result generalizes the pure strategy existence theorem of Dasgupta and Maskin (1986) and that it is neither implied nor does it imply the existence theorems of Baye, Tian, and Zhou (1993) and Reny (1999). Furthermore, we show that an equilibrium may fail to exist when, while maintaining weak payoff security, weak upper semicontinuity is weakened to reciprocal upper semicontinuity.
Resumo:
Over the years, several formalizations and existence results for games with a continuum of players have been given. These include those of Schmeidler (1973), Rashid (1983), Mas-Colell (1984), Khan and Sun (1999) and Podczeck (2007a). The level of generality of each of these existence results is typically regarded as a criterion to evaluate how appropriate is the corresponding formalization of large games. In contrast, we argue that such evaluation is pointless. In fact, we show that, in a precise sense, all the above existence results are equivalent. Thus, all of them are equally strong and therefore cannot rank the different formalizations of large games.
Resumo:
This paper extends the standard industrial organization models of repeated interaction between firms by incorporating preferences for reciprocity. A reciprocal firm responds to unkind behavior of rivals with unkind actions (destructive reciprocity), while at the same time, it responds to kind behavior of rivals with kind actions (constructive reciprocity). The main finding of the paper is that, for plausible perceptions of fairness, preferences for reciprocity facilitate collusion in infinitely repeated market games, that is, the critical discount rate at wish collusion can be sustained tends to be lower when firms have preferences for reciprocity than when firms are selfish. The paper also finds that the best collusive outcome that can be sustained in the infinitely repeated Cournot game with reciprocal firms is worse for consumers than the best collusive outcome that can be sustained in the infinitely repeated Cournot game with selfish firms.
Resumo:
The aim of this paper is to address some theoretical issues concerning the narrative practice in cyberspace. From a narratological perspective it intends to clarify the functioning of time and space in storytelling. For that purpose it traces the concept(s) of memory inherited from rhetoric; the use of memory as a narrative device in traditional accounts; the adaptations imposed by hyperfiction. Using practical examples (including two Portuguese case studies - InStory 2006, and Noon 2007) it will show how narrative memory strategies can be helpful in game literacy. The main purpose is to contribute to serious game research and (trans)literary studies.
Resumo:
Sign language is the form of communication used by Deaf people, which, in most cases have been learned since childhood. The problem arises when a non-Deaf tries to contact with a Deaf. For example, when non-Deaf parents try to communicate with their Deaf child. In most cases, this situation tends to happen when the parents did not have time to properly learn sign language. This dissertation proposes the teaching of sign language through the usage of serious games. Currently, similar solutions to this proposal do exist, however, those solutions are scarce and limited. For this reason, the proposed solution is composed of a natural user interface that is intended to create a new concept on this field. The validation of this work, consisted on the implementation of a serious game prototype, which can be used as a source for learning (Portuguese) sign language. On this validation, it was first implemented a module responsible for recognizing sign language. This first stage, allowed the increase of interaction and the construction of an algorithm capable of accurately recognizing sign language. On a second stage of the validation, the proposal was studied so that the pros and cons can be determined and considered on future works.
Resumo:
The mobile IT era is here, it is still growing and expanding at a steady rate and, most of all, it is entertaining. Mobile devices are used for entertainment, whether social through the so-called social networks, or private through web browsing, video watching or gaming. Youngsters make heavy use of these devices, and even small children show impressive adaptability and skill. However not much attention is directed towards education, especially in the case of young children. Too much time is usually spent in games which only purpose is to keep children entertained, time that could be put to better use such as developing elementary geometric notions. Taking advantage of this pocket computer scenario, it is proposed an application geared towards small children in the 6 – 9 age group that allows them to consolidate knowledge regarding geometric shapes, forming a stepping stone that leads to some fundamental mathematical knowledge to be exercised later on. To achieve this goal, the application will detect simple geometric shapes like squares, circles and triangles using the device’s camera. The novelty of this application will be a core real-time detection system designed and developed from the ground up for mobile devices, taking into account their characteristic limitations such as reduced processing power, memory and battery. User feedback was be gathered, aggregated and studied to assess the educational factor of the application.
Resumo:
Supportive presentation, computer games, non-photorealistic rendering camera control, camera AI, human factors, user interfaces, action summary, action replay, non-photorealistic rendering case studies, psychology
Resumo:
no.11(1923)
Resumo:
In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times.
Resumo:
We study the location-inventory model as introduced by Teo et al. (2001) to analyze the impact of consolidation of distribution centers on facility and inventory costs. We extend their result on profitability of consolidation. We associate a cooperative game with each location-inventory situation and prove that this game has a non-empty core for identical and independent demand processes. This illustrates that consolidation does not only lower joint costs (which was shown by Teo et al. (2001)), but it allows for a stable division of the minimal costs as well.
Resumo:
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.