A New Multi-Agent Game Solver
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2016, Vol 18, Issue 3
Abstract
Abstract: A new N-person game solver is presented in this work. The new software is an advance in the whole sate of art for the investigation of N-person games. It is now possible to investigate entire classes of games almost automatically. Moreover, this software makes it trivial to perform a systematic investigation of any game with a multidimensional parameter space. In addition, the payoff functions are no longer limited to quadratic expressions; any elementary mathematical function can easily be used, even in parameterized form. The experimental results are interesting and they very strongly depend on the initial conditions.
Authors and Affiliations
Miklos N Szilagyi
Keywords
Related Articles
- EP ID EP133480
- DOI -
- Views 117
- Downloads 0
Enhancing Security of Multimodal Biometric Authentication System by Implementing Watermarking Utilizing DWT and DCT
Conventional personal identification techniques for instance passwords, tokens, ID card and PIN codes are prone to theft or forgery and thus biometrics isa solution thereto. Biometrics is the way of recognizing &...
Applying Back Propagation Algorithm for classification of fragile genome sequence
Abstract : Most frequently occurring recurrent chromosomal translocation allied with all subtype of leukemia are available in Mitel Mann Data base. We have retrieved about 55 such genome sequence from TIC dB database wit...
Modified Contrast Enhancement using Laplacian and Gaussians Fusion Technique
Abstract: The aim of image fusion is to mix images of a scene captured below totally different illumination. One image contains most of information from the whole supply images automatically. Contrast enhancement is empl...
Comparative Performance Analysis of SALT and PEPPER Noise Removal
Abstract: Noise is an important factor which when get added to an image reduces its quality and appearance.So in order to enhance the image qualities, it has to be removed with preserving the textural information a...
Hybrid Algorithm combining Genetic algorithms and CSP approach to plane an Optimized path for a Mobile Robot moving under Time Window
Abstract: The problems of optimization are considered as a type of a constraint satisfaction problem: COP (Constraint Optimization problem). In this frame goes our first works which are interested in the optimi...