The personality behind cheating: behavioural types and the feeding ecology of cleaner fish

The complex mutualistic relationship between the cleaner fish (Labroides dimidiatus) and their 'clients' in many reef systems throughout the world has been the subject of debate and research interest for decades. Game-theory models have long struggled with explaining how the mixed strategies of cheating and honesty might have evolved in such a system and while significant efforts have been made theoretically, demonstrating the nature of this relationship empirically remains an important research challenge. Using the experimental framework of behavioural syndromes, we sought to quantitatively assess the relationship between personality and the feeding ecology of cleaner fish to provide novel insights into the underlying mechanistic basis of cheating in cleaner-client interactions. First, we observed and filmed cleaner fish interactions with heterospecifics, movement patterns and general feeding ecology in the wild. We then captured and measured all focal individuals and tested them for individual consistency in measures of activity, exploration and risk taking (boldness) in the laboratory. Our results suggest a syndrome incorporating aspects of personality and foraging effort are central components of the behavioural ecology of L. dimidiatus on the Great Barrier Reef. We found that individuals that exhibited greater feeding effort tended to cheat proportionately less and move over smaller distances relative to bolder more active, exploratory individuals. Our study demonstrates for the first time that individual differences in personality might be mechanistically involved in explaining how the mixed strategies of cheating and honesty persist in cleaner fish mutualisms.

Recommending best answer in a collaborative question answering system

The World Wide Web has become a medium for people to share information. People use Web-based collaborative tools such as question answering (QA) portals, blogs/forums, email and instant messaging to acquire information and to form online-based communities. In an online QA portal, a user asks a question and other users can provide answers based on their knowledge, with the question usually being answered by many users. It can become overwhelming and/or time/resource consuming for a user to read all of the answers provided for a given question. Thus, there exists a need for a mechanism to rank the provided answers so users can focus on only reading good quality answers. The majority of online QA systems use user feedback to rank users’ answers and the user who asked the question can decide on the best answer. Other users who didn’t participate in answering the question can also vote to determine the best answer. However, ranking the best answer via this collaborative method is time consuming and requires an ongoing continuous involvement of users to provide the needed feedback. The objective of this research is to discover a way to recommend the best answer as part of a ranked list of answers for a posted question automatically, without the need for user feedback. The proposed approach combines both a non-content-based reputation method and a content-based method to solve the problem of recommending the best answer to the user who posted the question. The non-content method assigns a score to each user which reflects the users’ reputation level in using the QA portal system. Each user is assigned two types of non-content-based reputations cores: a local reputation score and a global reputation score. The local reputation score plays an important role in deciding the reputation level of a user for the category in which the question is asked. The global reputation score indicates the prestige of a user across all of the categories in the QA system. Due to the possibility of user cheating, such as awarding the best answer to a friend regardless of the answer quality, a content-based method for determining the quality of a given answer is proposed, alongside the non-content-based reputation method. Answers for a question from different users are compared with an ideal (or expert) answer using traditional Information Retrieval and Natural Language Processing techniques. Each answer provided for a question is assigned a content score according to how well it matched the ideal answer. To evaluate the performance of the proposed methods, each recommended best answer is compared with the best answer determined by one of the most popular link analysis methods, Hyperlink-Induced Topic Search (HITS). The proposed methods are able to yield high accuracy, as shown by correlation scores: Kendall correlation and Spearman correlation. The reputation method outperforms the HITS method in terms of recommending the best answer. The inclusion of the reputation score with the content score improves the overall performance, which is measured through the use of Top-n match scores.

Exploring the opportunities and challenges of using mobile sensing for gamification and achievements

Gamified services delivered on smart phones, such as Foursquare, are able to utilise the sensors on the phone to capture user contexts as a means of triggering game elements. This paper identifies and discusses opportunities and challenges that exist when using mobile sensors as input for game elements. We present initial findings from a field study of a gamified mobile application made to support the university orientation event for new students using game achievements. The study showed that overall the use of context was well received by participants when compared to game elements that required no context to complete. It was also found that using context could help validate that an activity was completed however there were still technical challenges when using sensors that led to exploits in the game elements, or cheating.

Dispute resolution across platforms : offshore gambling industry & EVE online

Contemporary online environments suffer from a regulatory gap; that is there are few options for participants between customer service departments and potentially expensive court cases in foreign jurisdictions. Whatever form of regulation ultimately fills that gap will be charged with determining whether specific behavior, within a specific environment, is fair or foul; whether it’s cheating or not. However, cheating is a term that, despite substantial academic study, remains problematic. Is anything the developer doesn’t want you to do cheating? Is it only if your actions breach the formal terms of service? What about the community norms, do they matter at all? All of these remain largely unresolved questions, due to the lack of public determination of cases in such environments, which have mostly been settled prior to legal action. In this paper, I propose a re-branding of participant activity in such environments into developer-sanctioned, advantage play, and cheating. Advantage play, ultimately, is activity within the environment in which the player is able to turn the mechanics of the environment to their advantage without breaching the rules of the environment. Such a definition, and the term itself, is based on the usage of the term within the gambling industry, in which advantage play is considered betting with the advantage in the players’ favor rather than that of the house. Through examples from both the gambling industry and the Massively Multiplayer Role-Playing Game Eve Online, I consider the problems in defining cheating, suggest how the term ‘advantage play’ may be useful in understanding participants behavior in contemporary environments, and ultimately consider the use of such terminology in dispute resolution models which may overcome this regulatory gap.

Ideal threshold schemes from MDS codes

We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the correct secret. The construction is later generalised so the resulting secret sharing is resistant against the Tompa-Woll cheating.

Ideal threshold schemes from orthogonal arrays

The work investigates the design of ideal threshold secret sharing in the context of cheating prevention. We showed that each orthogonal array is exactly a defining matrix of an ideal threshold scheme. To prevent cheating, defining matrices should be nonlinear so both the cheaters and honest participants have the same chance of guessing of the valid secret. The last part of the work shows how to construct nonlinear secret sharing based on orthogonal arrays.

Exploring the effect of achievements on students attending university orientation

University orientation is a key event for new students that aids in the transition from a school to a university environment. A smartphone orientation application was built to aid students attending the event. Achievements were added to the application in an attempt to engage students further with the orientation activities and application. An exploratory field study was undertaken to evaluate the effect of the achievement system on participants attending orientation. Forty-six new students were recruited to test the orientation application. Twenty-six participants used a gamified version of the orientation application and twenty participants used a non-gamified version. While the gamification was generally well received, no impact on user experience was evident. Some effect on engagement with orientation activities was shown. Participants who used the gamified system reported the game elements as fun, but some negative issues arose, such as cheating.

Manipulating the data: Teaching and NAPLAN in the control society

High-stakes testing is changing what it means to be a ‘good teacher’ in the contemporary school. This paper uses Deleuze and Guattari's ideas on the control society and dividuation in the context of National Assessment Program Literacy and Numeracy (NAPLAN) testing in Australia to suggest that the database generates new understandings of the ‘good teacher’. Media reports are used to look at how teachers are responding to the high-stakes database through manipulating the data. This article argues that manipulating the data is a regrettable, but logical, response to manifestations of teaching where only the data counts.

Kristallivalheita : Itsepetos filosofisen tulkinnan lähtökohtana eräissä draaman klassikoissa

The philosophical problem of self-deception focuses the relation between desire, advantage, evidence and harm. A self-deceptive person is irrational because he or she belives or wants to belive contrary to the available evidence. The study focuses on different forms of self-deception that come out in certain classical Western dramas. The first self-deception forms are: "S knows that ~p but still belives that p because he wants that ~p", "S wants that p and therefore belives that p.", "S belives that p against evidence t because he wants to belive that p.", "S belives that p if t but S would belive that p even if ~t because S wants to belive that p.", "S belives that p (even if there is t that ~p) because S is ignorant of it." and "S belives that p (even if there is t that ~p) because of ignorant of t due to an internal deception." The main sources on self-deception are the views of contemporary researchers of the subject, such as Robert Audi, Marcia Baron, Bas C. van Fraassen, Mark Johnston, Mike W. Martin, Brian MaLaughlin, Alfred Mele, Amélie Oksenberg Rorty, William Ruddick and Stephen L. White. In this study it is claimed that Shakespeare´s Othello presents self-deception as a tragic phenomenom from witch it follows deceptions and murders. Moliére´s Tartuffe deals with a phony hypocrite´s attempts at cheating. Ibsen´s Wild Duck defends the necessity of vital lies. Beckett´s Waiting for Godot deals with the self-deception witch is related to the waiting of the supernatural rescuer. Miller´s The Death of a Salesman tells about a man who, while pursuing the American myth of success, winds both himself and his family into the skeins of self-deception. They are studied with a Barthesian method that emphasizes the autonomy of literary work and its interpretation independently of the author´s personal history and social conditions. Self-deception has been regarded as an immoral way of thinking or way of action. However, vital lies show the necessity or necessity of the self-deception when it brings joy and optimism to the human being and supports his or her self-esteem and does not cause a suffering or damage, either to self or others. In the study, the processual character of self-deception is brought out.

The sources of moral motivation : studies on empathy, guilt, shame and values

The goals of this study were to analyze the forms of emotional tendencies that are likely to motivate moral behaviors, and to find correlates for these tendencies. In study 1, students narratives of their own guilt or shame experiences were analyzed. The results showed that pure shame was more likely to motivate avoidance than reparation, whereas guilt and combination of guilt and shame were likely to motivate reparation. However, all types of emotion could lead to chronic rumination if the person was not clearly responsible for the situation. In study 2, the relations of empathy with two measures of guilt were examined in a sample of 13- to 16-year-olds (N=113). Empathy was measured using Davis s IRI and guilt by Tangney s TOSCA and Hoffman s semi-projective story completion method that includes two different scenarios, guilt over cheating and guilt over inaction. Empathy correlated more strongly with both measures of guilt than the two measures correlated with each other. Hoffman s guilt over inaction was more strongly associated with empathy measures in girls than in boys, whereas for guilt over cheating the pattern was the opposite. Girls and boys who describe themselves as empathetic may emphasize different aspect of morality and feel guilty in different contexts. In study 3, cultural and gender differences in guilt and shame (TOSCA) and value priorities (the Schwartz Value Survey) were studied in samples of Finnish (N=156) and Peruvian (N=159) adolescents. Gender differences were found to be larger and more stereotypical among the Finns than among the Peruvians. Finnish girls were more prone to guilt and shame than boys were, whereas among the Peruvians there was no gender difference in guilt, and boys were more shame-prone than girls. The results support the view that psychological gender differences are largest individualistic societies. In study 4, the relations of value priorities to guilt, shame and empathy were examined in two samples, one of 15 19-year-old high school students (N = 207), and the other of military conscripts (N = 503). Guilt was, in both samples, positively related to valuing universalism, benevolence, tradition, and conformity, and negatively related to valuing power, hedonism, stimulation, and self-direction. The results for empathy were similar, but the relation to the openness conservation value dimension was weaker. Shame and personal distress were weakly related to values. In sum, shame without guilt and the TOSCA shame scale are tendencies that are unlikely to motivate moral behavior in Finnish cultural context. Guilt is likely to be connected to positive social behaviors, but excessive guilt can cause psychological problems. Moral emotional tendencies are related to culture, cultural conceptions of gender and to individual value priorities.

How mutualisms between plants and insects are stabilized

While the idea of cooperation between individuals of a species has received considerable attention, how mutualistic interactions between species can be protected from cheating by partners in the interaction has only recently been examined from theoretical and empirical perspectives. This paper is a selective review of the recent literature on host sanctions, partner-fidelity feedback and the concept of punishment in such mutualisms. It describes new ideas, borrowed from microeconomics, such as screening theory with and without competition between potential partners for a host. It explores mutualism-stabilizing mechanisms using examples from interactions between figs and fig wasps, and those between ants and plants. It suggests new avenues for research.

The evolution of cooperation in asymmetric systems

Explaining "Tragedy of the Commons" of evolution of cooperation remains one of the greatest problems for both biology and social science. Asymmetrical interaction, which is one of the most important characteristics of cooperative system, has not been sufficiently considered in the existing models of the evolution of cooperation. Considering the inequality in the number and payoff between the cooperative actors and recipients in cooperation systems, discriminative density-dependent interference competition will occur in limited dispersal systems. Our model and simulation show that the local but not the global stability of a cooperative interaction can be maintained if the utilization of common resource remains unsaturated, which can be achieved by density-dependent restraint or competition among the cooperative actors. More intense density dependent interference competition among the cooperative actors and the ready availability of the common resource, with a higher intrinsic contribution ratio of a cooperative actor to the recipient, will increase the probability of cooperation. The cooperation between the recipient and the cooperative actors can be transformed into conflict and, it oscillates chaotically with variations of the affecting factors under different environmental or ecological conditions. The higher initial relatedness (i.e. similar to kin or reciprocity relatedness), which is equivalent to intrinsic contribution ratio of a cooperative actor to the recipient, can be selected for by penalizing less cooperative or cheating actors but rewarding cooperative individuals in asymmetric systems. The initial relatedness is a pivot but not the aim of evolution of cooperation. This explains well the direct conflict observed in almost all cooperative systems.

EGOIST: Overlay Routing Using Selfish Neighbor Selection

A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are analytically tractable, especially via game-theoretic analysis. In this paper, we unify these two thrusts by using insights gleaned from novel, realistic theoretic models in the design of Egoist – a prototype overlay routing system that we implemented, deployed, and evaluated on PlanetLab. Using measurements on PlanetLab and trace-based simulations, we demonstrate that Egoist's neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, we demonstrate that Egoist is competitive with an optimal, but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overhead. Finally, we discuss some of the potential benefits Egoist may offer to applications.

The EGOIST Overlay Routing System

A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and rewiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are analytically tractable, especially via game-theoretic analysis. In this paper, we unify these two thrusts by using insights gleaned from novel, realistic theoretic models in the design of Egoist – a distributed overlay routing system that we implemented, deployed, and evaluated on PlanetLab. Using extensive measurements of paths between nodes, we demonstrate that Egoist’s neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, we demonstrate that Egoist is competitive with an optimal, but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overhead. Finally, we use a multiplayer peer-to-peer game to demonstrate the value of Egoist to end-user applications. This technical report supersedes BUCS-TR-2007-013.