Results 81 to 90 of about 26,379 (227)
Implementation of the Minimax algorithm for Tic-Tac-Toe game and adaptation to n x m matrices. [PDF]
, 2022 openL’algoritmo Minimax è un algoritmo ricorsivo che ha come scopo la ricerca della mossa migliore in un gioco a somma zero, in cui la somma algebrica dei payoff è nulla (o costante).
PADOAN, CLAUDIO
core
A linear response bandit problem
Stochastic Systems, 2013 We consider a two–armed bandit problem which involves sequentialsampling from two non-homogeneous populations. The responsein each is determined by a random covariate vector and a vector ofparameters whose values are not known a priori.The goal is to ...
Assaf Zeevi, Alexander Goldenshluger
doaj
Two-Dimensional Minimax Latin Hypercube Designs [PDF]
We investigate minimax Latin hypercube designs in two dimensions for several distance measures.For the l-distance we are able to construct minimax Latin hypercube designs of n points, and to determine the minimal covering radius, for all n.For the l1 ...
Dam, E.R. van
core
MCTS-Minimax Hybrids with State Evaluations [PDF]
, 2018 Monte-Carlo Tree Search (MCTS) has been found to show weaker play than minimax-based search in some tactical game domains. This is partly due to its highly selective search and averaging value backups, which make it susceptible to traps.
Winands, M.H.M. (Mark) +3 more
core +1 more source
Advanced Engineering Research, 2011 V.N.Plotnikov - V.J.Zverev list algorithm is examined. Minimax, quadratic and cubic criteria are used. The software for the analysis of criteria efficiency is developed.
Valery G. Kobak, Mikhail A. Muratov
doaj
Professionals Do Not Play Minimax: Evidence from Major League Baseball and the National Football League [PDF]
Game theory makes strong predictions about how individuals should behave in two player, zero sum games. When players follow a mixed strategy, equilibrium payoffs should be equalized across actions, and choices should be serially uncorrelated.
Kenneth Kovash, Steven D. Levitt
core
Applications of generalized Ky Fan's matching theorem in minimax and variational inequality [PDF]
We present some application of the generalized Ky Fan's Matching Theorem stated by Chebbi, Gourdel and Hammami in minimax and variational inequalities using a generalized coercivity type condition for correspondences defined in L-space.L-structures, L ...
Pascal Gourdel, Hakim Hammami
core
Beyond the Minimax Principle [PDF]
Proceedings of the American Mathematical Society, 1981 Let A be selfadjoint and P an orthoprojector. Then for any real X, the compression of A to the subspace P% has spectral projector belonging to J\, oo( no larger in dimensionality than does A. This generalizes the classical Poincare inequality. Several other like generalizations are given of various versions of the "minimax principle".
openaire +1 more source
On Noncooperative Games, Minimax Theorems and Equilibrium Problems [PDF]
In this chapter we give an overview on the theory of noncooperative games. In the first part we consider in detail for zero-sum (and constant-sum) noncooperative games under which necessary and sufficient conditions on the payoff function and different ...
Kassay, G., Frenk, J.B.G.
core
Minimax Normal Two-Armed Bandit with Indefinite Control Horizon
ITM Web of Conferences, 2017 We consider the two-armed bandit problem as applied to data processing if there are two alternative processing methods available with different a priori unknown efficiencies.
Kolnogorov Alexander
doaj +1 more source