Cooperative game play with avatars and agents: Differences in brain activity and the experience of play

The current study sought to identify the impact of whether teammates in a cooperative videogame were controlled by other humans (avatars) or by the game (agents). The impact on player experience was explored through both subjective questionnaire measures and brain wave activity measurement (electroencephalography). Play with human teammates was associated with a greater sense of relatedness, but less competence and flow than play with other computer-controlled teammates. In terms of brain activity, play with human teammates was associated with greater activity in the alpha, theta and beta power bands than play with computer-controlled teammates. Overall, the results suggest that play with human teammates involves greater cognitive activity in terms of 'mentalising' than play with computer-controlled teammates. Additionally, the associations between subjective measures of player experience and brain activity are described. Limitations of the current study are identified and key directions for future research are discussed.

Grand Push Auto: A car based exertion game

Grand Push Auto is an exertion game in which players aim to push a full sized car to ever increasing speeds. The re-appropriation of a car as essentially a large weight allows us to create a highly portable and distributable exertion game in which the main game element has a weight of over 1000 kilograms. In this paper we discuss initial experiences with GPA, and present 3 questions for ongoing study which have been identified from our early testing: How might we appropriate existing objects in exertion game design, and does appropriation change how we think about these objects in different contexts, for example environmental awareness? How does this relate to more traditional sled based weight training? How can we create exertion games that allow truly brutal levels of force?

A cooperative game theoretic approach to prototype selection

In this paper we consider the task of prototype selection whose primary goal is to reduce the storage and computational requirements of the Nearest Neighbor classifier while achieving better classification accuracies. We propose a solution to the prototype selection problem using techniques from cooperative game theory and show its efficacy experimentally.

Representations of the Natural World in Old English Poetry

Review of Representations of the Natural World in Old English Poetry, by Jennifer Neville (Cambridge UP, 1999).

Exploring the post-genomic world: Differing explanatory and manipulatory functions of post-genomic sciences

Richard Lewontin proposed that the ability of a scientific field to create a narrative for public understanding garners it social relevance. This article applies Lewontin's conceptual framework of the functions of science (manipulatory and explanatory) to compare and explain the current differences in perceived societal relevance of genetics/genomics and proteomics. We provide three examples to illustrate the social relevance and strong cultural narrative of genetics/genomics for which no counterpart exists for proteomics. We argue that the major difference between genetics/genomics and proteomics is that genomics has a strong explanatory function, due to the strong cultural narrative of heredity. Based on qualitative interviews and observations of proteomics conferences, we suggest that the nature of proteins, lack of public understanding, and theoretical complexity exacerbates this difference for proteomics. Lewontin's framework suggests that social scientists may find that omics sciences affect social relations in different ways than past analyses of genetics.

Experimental implementation of a three qubit quantum game with corrupt source using nuclear magnetic resonance quantum information processor

In a three player quantum `Dilemma' game each player takes independent decisions to maximize his/her individual gain. The optimal strategy in the quantum version of this game has a higher payoff compared to its classical counterpart. However, this advantage is lost if the initial qubits provided to the players are from a noisy source. We have experimentally implemented the three player quantum version of the `Dilemma' game as described by Johnson, [N.F. Johnson, Phys. Rev. A 63 (2001) 020302(R)] using nuclear magnetic resonance quantum information processor and have experimentally verified that the payoff of the quantum game for various levels of corruption matches the theoretical payoff. (c) 2007 Elsevier Inc. All rights reserved.

Open-access more harm than good in developing world

The traditional 'publish for free and pay to read' business model adopted by publishers of academic journals can lead to disparity in access to scholarly literature, exacerbated by rising journal costs and shrinking library budgets. However, although the 'pay to publish and read for free' business model of open-access publishing has helped to create a level playing field for readers, it does more harm than good in the developing world.

The emerging world of small ORFs

Small open reading frames (sORFs) are an often overlooked feature of plant genomes. Initially found in plant viral RNAs and considered an interesting curiosity, an increasing number of these sORFs have been shown to encode functional peptides or play a regulatory role. The recent discovery that many of these sORFs initiate with start codons other than AUG, together with the identification of functional small peptides encoded in supposedly noncoding primary miRNA transcripts (pri-miRs), has drastically increased the number of potentially functional sORFs within the genome. Here we review how advances in technology, notably ribosome profiling (RP) assays, are complementing bioinformatics and proteogenomic methods to provide powerful ways to identify these elusive features of plant genomes, and highlight the regulatory roles sORFs can play.

Developing Peer-To-Peer Web Applications

As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform’s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.

Developing Peer-To-Peer Web Applications

As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.

Somali State Failure: Players, Incentives and Institutions

In Somalia the central government collapsed in 1991 and since then state failure became a widespread phenomenon and one of the greatest political and humanitarian problems facing the world in this century. Thus, the main objective of this research is to answer the following question: What went wrong? Most of the existing literature on the political economy of conflict starts from the assumption that state in Africa is predatory by nature. Unlike these studies, the present research, although it uses predation theory, starts from the social contract approach of state definition. Therefore, rather than contemplating actions and policies of the rulers alone, this approach allows us to deliberately bring the role of the society – as citizens – and other players into the analyses. In Chapter 1, after introducing the study, a simple principal-agent model will be developed to check the logical consistence of the argument and to make the identification of causal mechanism easier. I also identify three main actors in the process of state failure in Somalia: the Somali state, Somali society and the superpowers. In Chapter 2, so as to understand the incentives, preferences and constraints of each player in the state failure game, I in some depth analyse the evolution and structure of three central informal institutions: identity based patronage system of leadership, political tribalism, and the Cold War. These three institutions are considered as the rules of the game in the Somali state failure. Chapter 3 summarises the successive civilian governments’ achievements and failures (1960-69) concerning the main national goals, national unification and socio-economic development. Chapter 4 shows that the military regime, although it assumed power through extralegal means, served to some extent the developmental interest of the citizens in the first five years of its rule. Chapter 5 shows the process, and the factors involved, of the military regime’s self-transformation from being an agent for the developmental interests of the society to a predatory state that not only undermines the interests of the society but that also destroys the state itself. Chapter 6 addresses the process of disintegration of the post-colonial state of Somalia. The chapter shows how the regime’s merciless reactions to political ventures by power-seeking opposition leaders shattered the entire country and wrecked the state institutions. Chapter 7 concludes the study by summarising the main findings: due to the incentive structures generated by the informal institutions, the formal state institutions fell apart.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Design of incentive compatible protocols for wireless networks: A game theoretic approach

In this thesis work, we design rigorous and efficient protocols/mechanisms for different types of wireless networks using a mechanism design [1] and game theoretic approach [2]. Our work can broadly be viewed in two parts. In the first part, we concentrate on ad hoc wireless networks [3] and [4]. In particular, we consider broadcast in these networks where each node is owned by independent and selfish users. Being selfish, these nodes do not forward the broadcast packets. All existing protocols for broadcast assume that nodes forward the transit packets. So, there is need for developing new broadcast protocols to overcome node selfishness. In our paper [5], we develop a strategy proof pricing mechanism which we call immediate predecessor node pricing mechanism (IPNPM) and an efficient new broadcast protocol based on IPNPM. We show the efficacy of our proposed broadcast protocol using simulation results.