The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Computer game, a new field of artificial intelligence, as the name suggests, is to make the computer learn to think and play chess games like human beings. As one of the important research field of the artificial intelligence, computer game, which is considered as the touchstone of the artificial intelligence, has brought many important methods and theories to the field. Connect6, is a newly introduced...
In this paper we study the auction games for the allocation of divisible resources under the progressive second price mechanism under which the incentive compatibility holds, i.e., the truth-telling bid strategy is the best response of individual players under this mechanism. We design a novel dynamic process for the underlying PSP auction games following which the system will converge to the Nash...
In this paper, we present a new dynamic flow routing model on networks of parallel paths with capacities on edges and a regime of random queues at vertices. According to the introduced rules of waiting at vertices, we estimate the routing cost functions expressed by a mathematical expectation of a routing duration. For the corresponding routing game with nonatomic agents we prove the existence of...
In hierarchical electricity market, the retailers buy electricity from generation provider and then sell it to users. Retailers play an important role in the distribution channel by matching supply and demand, but they also potentially cause inefficiencies in electricity allocation. To induce an efficient allocation of electricity, we propose a novel hierarchical distributed method under PSP auction...
This paper addresses the pricing decision of the high timeliness merchandise under dynamic uncertainty, and investigates three different dual channel structures including retail channel, online channel and name-your-own-price (NYOP) channel. Firstly, this paper develops the aggregate demand function based on consumer utility theory, then analyzes the equilibrium pricing strategy and profit under different...
Recent years, Monte Carlo and UCT (Upper bound Confidence for Tree) have been widely used in algorithms of computer games, and considerably improved computer Go programs. Phantom Go is a game with incomplete information and different with Go. The study of Phantom Go is just beginning. Most algorithms of Phantom Go applying Monte Carlo or UCT directly, but results are not quite satisfactory. In this...
Bid evaluation mechanism is a key factor to the fairness of auction and resource allocation. The current bid evaluation process is usually done by two groups, business expert group and technical expert group, separately. Taking bounded rationality as precondition, it will induce the antagonistic feelings and non-cooperation behavior between two groups. This paper focus on bid evaluation behaviors...
Driver behavior diversity affects traffic process greatly especially for the traffic evacuation process. Taking the driver behavior diversity into consideration, this paper developed a meta-model of driver behavior in microscopic traffic evacuation simulation, named DGIT frame, which are Decision, Game, Individual and Transform. DGIT frame integrates heterogeneous models in different levels into a...
In this paper, linear quadratic stochastic zero-sum differential games for discrete-time Markov jump systems are discussed. It is shown that the existence condition of finite horizon stochastic zero-sum games is equivalent to the solvability of the associated difference Riccati equations, and that of infinite horizon stochastic zero-sum games is equivalent to the solvability of the associated algebraic...
The game of NoGo needs to be optimized its theoretical system and evaluation methods since it is been proposed in recent years. At present, most of the programs of NoGo are based on Monte-Carlo Tree Search (MCTS), but its programs are rarely based on static evaluation algorithm. In this paper, according to the rules and characteristics of NoGo, a static evaluation method has been put forward. In the...
Monte Carlo Tree Search (MCTS) algorithm has been proved to be very successful in many perfect information games such as Go and Amazon. This leads to a trend to apply MCTS in games with imperfect information. One popular method is called Determinized MCTS and its efficiency has been shown in many games. In this paper, we plan to apply determinized MCTS to Chinese Military Chess, which is a very popular...
Surakarta chess is one of Computer Olympiad chesses. Its Chessboard is irregular. The logical structure of Surakarta chess is studied. A new storage structure of realizing the computer game program of Surakarta chess is presented. Representation of chessboard and chessman are presented by using the new storage structure. It is quite easy to judge the position relation of chess pieces with the storage...
Computer game is an important search field of artificial intelligence. Dou Dizhu is a confrontational sports with cards in China. It is an incomplete information game. We analyze the process of Dou Dizhu and describe its computer game model in participator set, history set, participants function, information space, natural distribution, participant preference. This game model will be used to research...
Under the actual battlefield conditions, due to the impact of the terrain, the weather, and the enemy's intentional interference information, we can not always detect reliable information of the enemy, and can not make the right decisions, so it finally affect the decision maker's strategic intent. To ensure that our UAV obtain reliable information during the air combat, we proposed the method using...
This paper processes the formation problem of multiple agents by assuming multiple virtual leaders. The basic idea is stated as follows: every dynamic agent is equipped with a virtual leader, and the agents reach consensus with their virtual leaders on the velocity and position through assigning stable control laws. Therefore, to solve the formation problem we just need to preset the trajectories...
The valuation of game situation was experimentally studied according to the characteristics of Einstein würfelt nicht!(EWN), and a reasonable evaluation method is obtained in this paper. In addition, this paper presents an optimized Monte Carlo algorithm based on the valuation of game. Finally, the optimized Monte Carlo algorithm played chess respectively with the Mini-Max algorithm and Monte Carlo...
Computational complexity is a branch of the theory of computation. It is used to measure how hard a problem is solved and the common measures include time and space. The classes of time complexity generally include: P, NP, NP-hard, NP-complete and EXPTIME; the classes of space complexity generally include: PSPACE, NPSPACE, PSPACE-hard and PSPACE-complete. Researching computational complexity of a...
In this paper, we consider cooperative game with stochastic payoffs and give the definition of the Shapley value for it, which is obtained by extending the classical case. Then we provide explicit expression for the Shapley value of the cooperative game with stochastic payoffs, and discuss its existence and uniqueness. Finally, the properties of the Shapley value of convex cooperative game with stochastic...
This paper considers when a potential networked evolutionary game (NEG) converges to a Nash equilibrium. First, based on the fundamental evolutionary equation, the profile dynamics of an NEG is revealed. Then we show that an NEG is potential, if the fundamental network game is. Finally, a sufficient condition for an NEG to converge to a Nash equilibrium is presented. An illustrative example is included...
This paper introduces the Chinese chess recognition algorithm based on computer vision and image processing. In order to simplify processing and enhance efficiency, the images of chessboard and chessman need preprocessing in advance. The steps of preprocessing include of transformation from color images to gray images, images filtering with mean filter or median filter, and binaryzation of the gray...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.