Complete Game Research Articles

A fundamental study for partially defined cooperative games

The payoff of each coalition has been assumed to be known precisely in the conventional cooperative games. However, we may come across situations where some coalitional values remain unknown. This paper treats cooperative games whose coalitional values are not known completely. In the cooperative games it is assumed that some of coalitional values are known precisely but others remain unknown. Some complete games associated with such incomplete games are proposed. Solution concepts are studied in a special case where only values of the grand coalition and singleton coalitions are known. Through the investigations of solutions of complete games associated with the given incomplete game, we show a focal point solution suggested commonly from different viewpoints.

The Rényi–Ulam games and many-valued logics

In this paper we introduce complete game semantics for Product, Gödel, BL and SBL logics (game semantics for Łukasiewicz logic are well-known). For each of these logics we introduce a variant of the Rényi–Ulam game whose states are equipped in a natural way with an algebraic structure. Moreover we prove that each logic is complete with respect to the algebras of the states for the corresponding game.

The least square B-nucleolus for fuzzy cooperative games

The least square B-nucleolus for fuzzy cooperative games is proposed based on the bi-excess of fuzzy coalitions. The proposed solutions consider not only the size of fuzzy coalitions, but also the blocking and constructive powers. The uniqueness of the least square B-prenucleolus for fuzzy cooperative games is proved detailedly. Some quadratic programming models for generating the least square B-nucleolus of complete and incomplete fuzzy cooperative games are presented, respectively. The least square B-prenucleolus is extended to the multiplicative setting, and the logarithmic least square B-prenucleolus for multiplicative fuzzy cooperative games is derived.

Forecasting Unusual Infection of Patient used by Irregular Weighted Point Set

Mining association rule is a key issue in data mining. In any case, the standard models ignore the distinction among the exchanges, and the weighted association rule mining does not transform on databases with just binary attributes. Paper propose a novel continuous examples and execute a tree (FPtree) structure, which is an increased prefix-tree structure for securing compacted, discriminating data about examples, and make a fit FP-tree- based mining system, FP enhanced capacity algorithm is used, for mining the complete game plan of examples by illustration incessant development. Here in this paper handles the motivation behind making remarkable and weighted itemsets, i.e. rare weighted item set mining issue. The two novel brightness measures are proposed for figuring the infrequent weighted itemset mining issue. Also, the algorithm are handled which perform IWI which is more insignificant IWI mining. Moreover we utilized the rare itemset for choice based structure. The general issue of the start of reliable definite rules is troublesome for the grounds that hypothetically no inciting technique with no other person can promise the rightness of influenced theories. In this way this framework expects the disorder with the uncommon signs. Usage study demonstrates that proposed algorithm upgrades the structure which is successful and versatile for mining both long and short diagnostics rules. Structure upgrades aftereffects of foreseeing rare diseases of patient.

Flow framework for analyzing the quality of educational games

The challenge of educational game design is to develop solutions that appeal to as many players as possible, but are still educationally effective. One foundation for analyzing and designing educational engagement is the flow theory. This article presents a flow framework that describes the dimensions of flow experience that can be used to analyze the quality of educational games. The framework also provides design-support for producing good educational games, because it can be used to reveal ways to optimize learning effects and user experience. However, the framework only works as a link between educational theory and game design, which is useful for game analysis but does not provide the means for a complete game design. To evaluate the elements included in the proposed framework, we analyzed university student’s experiences in participating in a business simulation game. We found that the students’ flow experience in the game was high and the findings indicated that sense of control, clear goals and challenge-skill dimensions of flow scored the highest. Overall, the results indicate that the flow framework is a useful tool to aid the analysis of game-based learning experiences.

Researches on Data Privacy in Cloud Computing Based on Game Theory

Existing proposals for data privacy in cloud computing have typically been founded on encryption and are not well-balanced on dealing with the contradiction between data privacy and efficient queries. This paper discusses the data privacy in cloud computing based on the perspective of game theory. It built a complete information static game theory frame between a trusted data center and many un-trusted database service providers to avoid the coalition among un-trusted database service providers, and gave Nash equilibrium of mixed strategy. Some influence factors of Nash equilibrium are also analyzed.

Social Story Worlds With Comme il Faut

This paper presents Comme il Faut (CiF), an artificial intelligence system that matches character performances to appropriate social context, with the goal of enabling authors to write high-level rules governing expected character behavior in given social situations, rather than specific fixed choice points in a curated narrative structure. CiF models characters with a complex set of traits, feelings, and relationships, who can form intents, take actions, relate to a shared cultural space, and remember and refer to past events. A set of authored rules encoding appropriate behavior within a specific story world allow these characters to select actions to take (and respond to actions by others) in a manner consistent with their own personal and social concerns as well as a shifting interpersonal context. Through the development and release of Prom Week, a complete game using CiF as its narrative engine, we show how the system successfully creates complex narratives that are unique for each player and directed by those players' attempts to make progress towards story goals. We also show how CiF continues to be used in several in-progress interactive experiences (Mismanor and IMMERSE), speaking to the utility and flexibility of its design.

The Second-Degree Price Discrimination of m Firms with n Demand Intervals Pricing Based on Cournot Model

Under the condition of linear demand function, the distribution law of equilibrium segment points of firms enforcing second-degree price discrimination to maximize respective revenues is analyzed in the case of m firms with n intervals pricing by using complete information static game theory. This is a promotion for two firms pricing with n segment intervals and m firms pricing with two segment intervals. The results show that: when m firms divide demand to enforce second-degree price discrimination, the necessary condition of revenue maximization is to divide demand into some intervals and let the length of each interval become geometric series, whose common ratio is 1 / m. The unified formula of equilibrium production, equilibrium price and market equilibrium total revenue of all four kinds of markets under the condition of second-degree price discrimination are presented in the most general sense, further more, the nature of which are analyzed in detail.

The Energy-Saving Management System Design of Major Projects in Implementation

The energy-saving management system of major projects in implementation has always been in a state of imperfect. On the basis of combining energy-saving management status of major projects in implementation, referring to the research results of the management mechanism design theory at home and abroad, this paper aims at the primary interest-related subjects of the major projects energy-saving, uses economic mechanism designing theory and incentive theory, designs the energy-saving management mechanism; It does the theoretical analysis of the government and major projects owner with the complete information dynamic game model, then, provides decision evidence for the government to formulate the rational management intensity and maximize the interests of all parties. At last, the paper provides the suggestions to solve the existing problems of major projects energy-saving management.

Analysis on Third-Degree Price Discrimination in Oligopoly Market Based on Static Game Theory

Equilibrium production, equilibrium price and equilibrium total revenue in the case of implementing third-degree price discrimination and unified pricing were analyzed under the condition of two oligopoly firms with 2 sub markets by complete information static game method, and the relationship between the three indexes of the two cases were studied. The results showed that, under the condition of linear demand functions of the two sub markets, the equilibrium output of unified pricing was equal to the equilibrium output of discriminative pricing; the equilibrium price of unified pricing was weighted average of the equilibrium prices of two sub markets while discriminative pricing; the equilibrium total revenue of unified pricing was less than the equilibrium total revenue of discriminative pricing.

Designing games in the classroom: Learning benefits

Designing games in the classroom: Learning benefits

Researches on Data Correctness and Completeness in Cloud Computing Based on Game Theory

Ensuring data correctness and data completeness in cloud computing, in addition to security technologies, many other factors need also be considered, such as the behaviors of participants of cloud computing. This paper discusses the data correctness and completeness in cloud computing based on the perspective of game theory. It built a complete information static game theory frame between a trusted data center and an un-trusted database service provider, and gave the mixed strategy Nash equilibrium. It also proposed some countermeasures and suggestions to improve the data security in cloud computing.

Research of Railway Capacity Strengthening Scheme Decision Method Based on Game Theory

Firstly, established the optimization model based on complete information static game theory, which see evaluation index as the participants of a game, capacity strengthening strategies as the strategies of participants, and the strategies contained in the Nash equilibrium of the game as the first step optimization results. Then structure an algorithm to secondary selection, which makes there is only one strategy in the final result. At last given a case study combined with Baoshen railway capacity strengthening scheme decision. The result indicated that the model has good applicability, and can reduce the subjective error effectively.

Enumeration of Weighted Games with Minimum and an Analysis of Voting Power for Bipartite Complete Games with Minimum

This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class as well. Second, we focus on the special case of bipartite complete games with minimum, and we compare and rank these games according to the behavior of some efficient power indices of players of type 1 (or of type 2). The main result of this second part establishes all allowable rankings of these games when the Shapley-Shubik power index is used on players of type 1.

Achievable hierarchies in voting games with abstention

It is well known that he influence relation orders the voters the same way as the classical Banzhaf and Shapley–Shubik indices do when they are extended to the voting games with abstention (VGA) in the class of complete games. Moreover, all hierarchies for the influence relation are achievable in the class of complete VGA. The aim of this paper is twofold. Firstly, we show that all hierarchies are achievable in a subclass of weighted VGA, the class of weighted games for which a single weight is assigned to voters. Secondly, we conduct a partial study of achievable hierarchies within the subclass of H-complete games, that is, complete games under stronger versions of influence relation.

Research on Design Index of Low-Carbon Highway Route Based on Game Theory

Highway route design indexes are the key factors which can determine the overall performance of highway. They affect not only the economy, safety, function of highway, but also affect the amount of CO2 emissions of highway. In order to find the most reasonable route design indexes, firstly, establish the function relationship between route design indexes and carbon emissions and cost-effectiveness of highway and social environment. Secondly, analyze action strategies of the highway construction main bodies and the social environment main bodies based on game theory. Thirdly, establish the complete information static game model, and solve to get the pure strategy Nash equilibrium in different circumstances. Establish a set of methods of evaluating highway route design indexes. Provide a scientific decision basis for highway construction departments.

The minimum sum representation as an index of voting power

We propose a new power index based on the minimum sum representation (MSR) of a weighted voting game. The MSR offers a redesign of a voting game, such that voting power as measured by the MSR index becomes proportional to voting weight. The MSR index is a coherent measure of power that is ordinally equivalent to the Banzhaf, Shapley–Shubik and Johnston indices. We provide a characterization for a bicameral meet as a weighted game or a complete game, and show that the MSR index is immune to the bicameral meet paradox. We discuss the computation of the MSR index using a linear integer program and the inverse MSR problem of designing a weighted voting game with a given distribution of power.

Research of Cascade Reservoirs Flood Limit Level Dynamic Control Based on Game Theory

This paper proposes a cascade reservoir flood limit level control model based on complete information dynamic game. By solving the model, the result shows that under the premise of ensuring flood safety, this equalization scheme will increase generating capacity, guaranteed output, and improve water utilization, effectively solve the conflict between flood protection and conservation.

Game Analysis of Internal Control and Risk Management

Based on examining links and differences between internal control and risk management from their definition,this paper mainly analyzes their relation with game theory. A complete information static game model isestablished and payoff functions for managers and investors are designed. The result shows that the decrease ofbusiness risk cannot be realized by severe penalties, instead, the frequency of internal control in risk monitoringmust be taken into consideration, and otherwise it will stimulate enterprise risk monitoring paradox. It is aneffective way for enterprises to reduce risk by lowering the cost of internal control in risk monitoring andimproving the ability of risk prevention.

Motion Characteristics of Youth Women Soccer Matches: Female Athletes in Motion (FAiM) Study

This study determined the locomotor characteristics for youth female soccer matches. 89 female soccer players (U-15-U-17) were assessed during a youth national championship or a talent identification camp using a Global Positioning System. Positional and age-group comparisons of locomotor characteristics were made for complete games, each half, differences between halves as well as sprint profiles using an ANCOVA adjusting for the differences in game or half durations, respectively. Midfielders covered greater distances (8 449 ± 170 m) than defenders (7 779 ± 114 m), mostly from more low- (2 553 ± 99 m vs. 2 151 ± 66 m) and moderate-speed running (1 389 ± 78 m vs. 1 142 ± 52 m). Forwards had more sprint distances (275 ± 42 m), sprints (15 ± 2) and greater maximum speed (26.7 ± 0.6 km · h(-1)) than midfielders (131 ± 24 m, 8 ± 1, 24.7 ± 0.4 km · h(-1), respectively). There was a tendency for increased distances within most velocity bands, workrate and sprints with increasing age. There was a greater increase in walking and jogging between the first and second half for forwards than defenders and midfielders. Youth female soccer players covered 6 500-9 000 m during matches with positional distinctions that are comparable to elite-standard women. These data provide novel insight into the physical demands of female youth soccer and should be used to establish appropriate age-group and positional strategies for training and development.