Simple Game Research Articles

WITHDRAWN: Real-Time Monitoring Of Big Data Sports Teaching Data Based On Complex Embedded System

The growing mindset that oversees one of the fundamental difficulties created in the big data austerity tings (population) internet industry. Unpredictable from many parts of the big data life cycle, for example, collecting, for example, cloud packing them and having the latest progress cycle information including, including, Extensible Markup Language (XML) and resource interpretation framework. This management structure that is going on simply because the way manage the system does not change. They have become a basic device in the world of games. Previously, the execution of the game to usually completed by cutting the hours or days after the game — this video has a detailed cycle to the original map with each player developing. The ever-evolving gaming application remote sensor and minor improvements give new doors open for improvement. Sensor gadgets are gradually becoming smarter and more flexible, adjusting to freely linked and approved execution information technology capabilities. The various advantages, organizational capability and usefulness of this phone will allow to use the program, then again, with impossible observations and schedule changes. This paper proposes a simple and generic game system to integrate into the online survey of imagination and standard input strategy to ensure non-exclusivity.

Sense of Agency and User Experience: Is There a Link?

Sense of control is increasingly used as a measure of quality in human-computer interaction. Control has been investigated mainly at a high level, using subjective questionnaire data, but also at a low level, using objective data on participants’ sense of agency. However, it remains unclear how differences in higher level, experienced control reflect lower level sense of control. We study that link in two experiments. In the first one we measure the low-level sense of agency with button, touchpad, and on-skin input. The results show a higher sense of agency with on-skin input. In the second experiment, participants played a simple game controlled with the same three inputs. We find that on-skin input results in both increased sense and experience of control compared to touchpad input. However, the corresponding difference is not found between on-skin and button input, whereas the button performed better in the experiment task. These results suggest that other factors of user experience spill over to the experienced control at rates that overcome differences in the sense of control. We discuss the implications for using subjective measures about the sense of control in evaluating qualities of interaction.

Escape room: using a simple text-based game to promote business undergraduates’ digital self-reliance

This case study aims to highlight the ease of use and effectiveness of an escape room game by describing how it was implemented in an undergraduate business course. The case study demonstrates the simplicity of a straightforward text-based game and how this was used in a large course of online students. Our case study aims to present our experience of implementing the escape room game from a practical perspective. We add to our narrative some descriptive statistics from a student survey conducted after the game. The case study builds on existing work in this field by extending its use beyond small face-to-face sessions to a technique suitable for far larger classes in an online format.

Value iteration for simple stochastic games: Stopping criterion and learning algorithm

The classical problem of reachability in simple stochastic games is typically solved by value iteration (VI), which produces a sequence of under-approximations of the value of the game, but is only guaranteed to converge in the limit. We provide an additional converging sequence of over-approximations, based on an analysis of the game graph. Together, these two sequences entail the first error bound and hence the first stopping criterion for VI on simple stochastic games, indicating when the algorithm can be stopped for a given precision. Consequently, VI becomes an anytime algorithm returning the approximation of the value and the current error bound. We further use this error bound to provide a learning-based asynchronous VI algorithm; it uses simulations and thus often avoids exploring the whole game graph, but still yields the same guarantees. Finally, we experimentally show that the overhead for computing the additional sequence of over-approximations often is negligible.

Comparison of algorithms for simple stochastic games

Simple stochastic games are turn-based 2½-player zero-sum graph games with a reachability objective. The problem is to compute the winning probabilities as well as the optimal strategies of both players. In this paper, we compare the three known classes of algorithms – value iteration, strategy iteration and quadratic programming – both theoretically and practically. Further, we suggest several improvements for all algorithms, including the first approach based on quadratic programming that avoids transforming the stochastic game to a stopping one. Our extensive experiments show that these improvements can lead to significant speed-ups. We implemented all algorithms in PRISM-games 3.0, thereby providing the first implementation of quadratic programming for solving simple stochastic games.

Longitudinal analysis of sustained performance on gamified cognitive assessment tasks

Serious games aim to provide cognitive assessments that are more enjoyable and easier to self-administer, potentially leading to more frequent assessments. We carried out two studies examining the relationship between game-playing enjoyment, game difficulty, and cognitive (game) performance. In the first study, 16 participants played three serious games once a week over four weeks as part of an undergraduate course, but with relatively minor motivation in terms of course credits. In the second study, 14 participants played serious games over six sessions in a period of three weeks. Participants included graduate students receiving credit for the course project (a major component of the grade) and friends and family that they recruited. Performance in the more difficult tasks tended to improve over time in the second study, but not in the first. Participants from the first study showed an overall negative sentiment toward the games. However, participants from the second study enjoyed the majority of games except for the more difficult games that required players to temporarily hold and memorize information. Participants got significantly better in the more difficult working memory games, even though these games were less popular than the simpler games. Our interpretation of the results is that enjoyability is important in encouraging people to keep playing cognitive assessment games as time progresses, and that enjoyability helps in maintaining performance in easy games. Higher motivation on the other hand played a significant role in facilitating learning effects in difficult games as well as in maintaining enjoyability.

A simple game and its dynamical richness for modeling synchronization in firefly-like oscillators

Synchronization in pulse-coupled oscillators has been broadly studied under different perspectives. We present a game with simple rules to describe synchronization in such kinds of oscillators. This game, intended to describe easily how fireflies synchronize, constitutes a discrete model different from those based on maps, ordinary differential equations, or multi-agent systems. Our results on complete synchronization depend strongly on the used rules that we compare statistically. We also calculate the basins of attraction to quantify the importance of the initial conditions in reaching or not synchronization and the time intervals required for that.

The Brinkmanship Game: Bargaining Under the Mutual Risk of Escalation

This article describes a simple two-player game which illustrates basic concepts of brinkmanship, to include calculations of probability and expected outcomes, and risk-taking profiles. The game befits a single 50-minute class period with introduction, gameplay, and discussion. The game can supplement the study of conflict from classic Cold War case studies of crisis bargaining, to arms control, or negotiating international protocols for global climate change such as the Paris Agreement. The Brinkmanship Game was developed for the seventh week of a 10-week graduate course called Game Theory and Decisionmaking: Exploring Strategic Situations. The course features a flipped classroom with class time devoted to experimentation, gameplay, and discussion of readings and games; lectures are online. The Brinkmanship Game would be appropriate for students in any advanced undergraduate or graduate level course in international relations, security studies, negotiation, or game theory. The Brinkmanship Game provides an active learning opportunity that can be valuable for encouraging students to come to their own understanding of concepts of mutual risk-taking. The authors have found the game to be effective in the classroom and hope it may prove valuable to those searching for ways to motivate students and to help them learn.

Breaking the bonds of reinforcement: Effects of trial outcome, rule consistency and rule complexity against exploitable and unexploitable opponents.

In two experiments, we used the simple zero-sum game Rock, Paper and Scissors to study the common reinforcement-based rules of repeating choices after winning (win-stay) and shifting from previous choice options after losing (lose-shift). Participants played the game against both computer opponents who could not be exploited and computer opponents who could be exploited by making choices that would at times conflict with reinforcement. Against unexploitable opponents, participants achieved an approximation of random behavior, contrary to previous research commonly finding reinforcement biases. Against exploitable opponents, the participants learned to exploit the opponent regardless of whether optimal choices conflicted with reinforcement or not. The data suggest that learning a rule that allows one to exploit was largely determined by the outcome of the previous trial.

Evolutionary multigame with conformists and profiteers based on dynamic complex networks.

Evolutionary game on complex networks provides a new research framework for analyzing and predicting group decision-making behavior in an interactive environment, in which most researchers assumed players as profiteers. However, current studies have shown that players are sometimes conformists rather than profit-seeking in society, but most research has been discussed on a simple game without considering the impact of multiple games. In this paper, we study the influence of conformists and profiteers on the evolution of cooperation in multiple games and illustrate two different strategy-updating rules based on these conformists and profiteers. Different from previous studies, we introduce a similarity between players into strategy-updating rules and explore the evolutionary game process, including the strategy updating, the transformation of players' type, and the dynamic evolution of the network structure. In the simulation, we implement our model on scale-free and regular networks and provide some explanations from the perspective of strategy transition, type transition, and network topology properties to prove the validity of our model.

Games in the Time of COVID-19: Promoting Mechanism Design for Pandemic Response

Most governments employ a set of quasi-standard measures to fight COVID-19, including wearing masks, social distancing, virus testing, contact tracing, and vaccination. However, combining these measures into an efficient holistic pandemic response instrument is even more involved than anticipated. We argue that some non-trivial factors behind the varying effectiveness of these measures are selfish decision making and the differing national implementations of the response mechanism. In this article, through simple games, we show the effect of individual incentives on the decisions made with respect to mask wearing, social distancing, and vaccination, and how these may result in sub-optimal outcomes. We also demonstrate the responsibility of national authorities in designing these games properly regarding data transparency, the chosen policies, and their influence on the preferred outcome. We promote a mechanism design approach: It is in the best interest of every government to carefully balance social good and response costs when implementing their respective pandemic response mechanism; moreover, there is no one-size-fits-all solution when designing an effective solution.

Rules Based Algorithm for AI game JADDWAL

The video game landscape is populated by games that rely on AI to make the player have a challenging and enjoyable experience, especially as games keep getting better and better in terms of performance and technology, soon it will be hard to ignore it as just a game and perceive it as a technological accomplishment, In this paper, we implemented a Rules-Based Algorithm to create an AI for a relatively simple game, We further analyze how the AI works and functions and if it would be the best suited for a simple video board game.
 :

Utilizing the Maximum Workload Range for Practice Periodization

Commentary The maximum workload range (max range) is a concept suggested by Sanders et al.1 regarding a method used to prescribe adequate practice workloads based off wearable technology data. The max range is calculated as follows from game data: Max Range = (Mean Total Distance + 1 St. Dev.) to (Maximum Total Distance) While the example provided utilizes total distance, the max range can be applied to key performance indicators such as high-speed distance, training load, jumps, etc. that are tracked throughout the competitive season in team sports. The max range concept was developed from research that found 12-17% of the time, football athletes, depending on position, accumulated game workloads outside their position’s mean + 1SD. Anecdotally, many coaches and practitioners use simple game averages as a control for ideal practice volumes. Based on previous research, using the game average as control training threshold may result in some high performing athletes being under-conditioned. It is reasonable to suggest that potential compound effects may occur throughout an entire season if athletes are not engaging in rigorous training loads that mimic game-like volumes and intensities. Figure 1. Theoretical football periodization structure for a defensive back using the max range for high intensity training days.

Serious video games and psychological support: A depression intervention among young cancer patients

Depression, coupled with a cancer diagnosis in early childhood, often leads toward disinclination to psychotherapy, especially in children. However, a possible remedy could be found in video games that could reduce the depressive condition. This study investigates two games and our results show that the ability of therapy embedded game (3D-GIT) is relatively better than the simple serious game (Remission-II) in reducing depressive symptoms associated with a cancer diagnosis. The sample comprised of 60 cancer patients, randomly selected from different cancer hospitals in Pakistan. All the patients were pre-tested using the Center for Epidemiological Studies Depression Scale for Children (CES-DC). The sample was randomly divided into two equal groups: one group played the 3D-GIT game, and the other played the Remission-II game. The games were played four times a week for a month. All the patients were then re-tested on the same scale. Pre-test and post-test scores were compared through paired t-test analysis. The findings of the study support the first two hypotheses that 3D-GIT and Re-Mission-2 are effective in reducing depressive symptoms among young cancer patients. The study results reveal that these video games could be used as an alternative treatment of depression for those who could not or are unwilling to go for counseling sessions with clinical psychologists. However, the results show that there are no significant differences between 3D-GIT and Remission-II games, suggesting that both games effectively reduce depressive symptoms among cancer patients. The study results support that the 3D-GIT game and the Remission-II game could be used to reduce depression among cancer patients.

Probit and Wealth Inequality—How Random Events and the Laws of Probability Are Partially Responsible for Wealth Inequality

Using two very simple coin-toss games, we demonstrate how the laws of probability affect wealth distribution. Even in a group of people who are identical in every way and are only subject to random costs (such as that incurred from severe weather, major illness, and bad accidents) or random benefits (such as those derived from lucky breaks), the distribution of wealth will be nudged towards taking the shape of the normal distribution’s cousin, the probit, with its very unequal allocation. The larger these random costs and benefits are and the more frequently they occur, the more severe inequality will become. Moreover, the inequality will tend to be most extreme at the very top and very bottom of the wealth distribution, reflecting the asymptotic curls at either end of the probit curve.

Comparison of Shapley-Shubik and Banzhaf-Coleman power indices applied to aggregation of predictions obtained based on dispersed data by k-nearest neighbors classifiers

In this paper a new method of fusion predictions obtained based on dispersed data is proposed. In the method a power index is used. This approach allows to calculate the real power of prediction vectors generated based on local data with using the k-nearest neighbors classifier. The use of two power indices: Shapley-Shubik and Banzhaf-Coleman power index is analyzed. The influence of k-parameter value and the value of quota in simple game on the classification accuracy is also studied. The obtained results are compared with the approach in which the power index was not used. It was found that the proposed method of using the power index improves the classification accuracy. Moreover, both analyzed power indices generate comparable results.

Shoot2Learn: Fix-and-Play Educational Game for Learning Programming; Enhancing Student Engagement by Mixing Game Playing and Game Programming

Aim/Purpose: The key objective of this research is to examine whether fix-and-play educational games improve students' performance in learning programming languages. We also quantified the flow experiences of the students and analyzed how the flow contributes to their academic performances. Background: Traditionally, learning the first computer programming language is considered challenging, In this study, we propose the fix-and-play gaming approach that utilizes the following three facts to alleviate certain difficulties associated with learning programming: 1. digital games are computer programs, 2. young students are fond of playing digital games, and 3. students are interested in creating their own games. Methodology: A simple casual game Shoot2Learn was created for learning the fundamentals of branching. A number of errors were intentionally implanted in the game at different levels, and the students were challenged to fix the bugs before continuing the game. During the play, the program keeps records of the student’s academic progress and the time logs at different stages to measure the flow experience of the students. The proposed approach was systematically evaluated using a quasi-experimental design in real classroom settings in two countries, Sri Lanka, and USA. Contribution: The results derived from this research provide empirical evidence that the fix-and-play educational games ease some challenges in learning programming and motivate the students to play and learn. Findings: The results show that the first-year programming students who play the fix-and-play game gain statistically significant improvement in their academic performance. However, the result fails to suggest a significant positive correlation between the flow experience and academic performance. Recommendations for Practitioners: Empowering the students to fix the bugs in the educational games they play will motivate them to stay in the game and learn continuously. However, we have to make sure that the types and timing of bugs do not hinder the flow experience of the players, Recommendation for Researchers: Students normally play industry-level high-quality games. Experience and interest in game-playing differ significantly between students. Gender difference also plays an important role in selecting game genres. We need to identify how to address these issues when resources are not sufficient to provide an individualized gaming experience. Impact on Society: Programming is an essential skill for computer science students. The outcome of this research shows that the proposed approach helps to reduce the disenchantment associated with learning the first programming language. Future Research: Further investigation is necessary to verify whether the AI techniques such as user modeling can be used in educational games to reduce the effects of uncertainty associated with the variations in students' gaming skills and other factors.

Pre-existing fairness concerns restrict the cultural evolution and generalization of inequitable norms in children

Many social exchanges produce benefits that would not exist otherwise, but anticipating conflicts about how to distribute these benefits can derail exchange and destroy the gains. Coordination norms can solve this problem by providing a shared understanding of how to distribute benefits, but such norms can also perpetuate group-level inequality. To examine how inequitable norms evolve culturally and whether they generalize from one setting to another, we conducted an incentivized lab-in-the-field experiment among kindergarten (5–6) and second-grade (8–9) children living in Switzerland (4′228 decisions collected from 326 children). In Part 1, we created two arbitrarily marked groups, triangles and circles. We randomly and repeatedly formed pairs with one triangle and one circle, and players in a pair played a simple bargaining game in which failure to agree destroyed the gains from social exchange. At the beginning of Part 1 we suggested a specific way to play the game. In symmetric treatments, this suggestion did not imply inequality between the groups, while in asymmetric treatments it did. Part 2 of the experiment addressed the generalization of norms. Retaining their group affiliations from Part 1, each child had to distribute resources between an in-group member and an out-group member. Children of both age groups in symmetric treatments used our suggestions about how to play the game to coordinate in Part 1. In asymmetric treatments, children followed our suggestions less consistently, which reduced coordination but moderated inequality. In Part 2, older children did not generalize privilege from Part 1. Rather, they compensated the underprivileged. Younger children neither generalized privilege nor compensated the underprivileged.

ЛИНЕЙНАЯ ДИФФЕРЕНЦИАЛЬНАЯ ИГРА УДЕРЖАНИЯ С ПОЛОМКОЙ

A linear simple motion constraint differential game is considered. This game is considered from the part of the first player, who needs to keep the state of the system in a given convex terminal set throughout the game, despite the possible glitch and control of the second player. A glitch is understood as an instantaneous stop of the first player at a previously unknown point in time; after a certain time he will eliminate the glitch and will continue his motion. The player control vectograms are n-dimensional convex compacts that depend on time. To construct a u-stable bridge, the second method of L.S. Pontryagin is used. This is how a multi-valued mapping is constructed on the basis of the alternating integral of L.S. Pontryagin. After that, it is proved that the constructed mapping is a u-stable bridge for the game under consideration if a number of conditions are satisfied. At the end of the article, a simple example on the plane is considered, where the vectors of the players are circles centered at the origin and with a constant radius, while the radius of the circle of the first player is strictly greater than the second. In this example, a u-stable bridge is built according to the method proposed in the article, and an extremal strategy is found for the first player on the constructed u-stable bridge.

Extremal Coalitions for Influence Games Through Swarm Intelligence-Based Methods

An influence game is a simple game represented over an influence graph (i.e., a labeled, weighted graph) on which the influence spread phenomenon is exerted. Influence games allow applying different properties and parameters coming from cooperative game theory to the contexts of social network analysis, decision-systems, voting systems, and collective behavior. The exact calculation of several of these properties and parameters is computationally hard, even for a small number of players. Two examples of these parameters are the length and the width of a game. The length of a game is the size of its smaller winning coalition, while the width of a game is the size of its larger losing coalition. Both parameters are relevant to know the levels of difficulty in reaching agreements in collective decision-making systems. Despite the above, new bio-inspired metaheuristic algorithms have recently been developed to solve the NP-hard influence maximization problem in an efficient and approximate way, being able to find small winning coalitions that maximize the influence spread within an influence graph. In this article, we apply some variations of this solution to find extreme winning and losing coalitions, and thus efficient approximate solutions for the length and the width of influence games. As a case study, we consider two real social networks, one formed by the 58 members of the European Union Council under nice voting rules, and the other formed by the 705 members of the European Parliament, connected by political affinity. Results are promising and show that it is feasible to generate approximate solutions for the length and width parameters of influence games, in reduced solving time.