Results 161 to 170 of about 71,119 (185)
Some of the next articles are maybe not open access.
SIAM Journal on Control and Optimization, 1995
Summary: The relaxation of the optimal control problem with cost functional which is the supremum in time of some function \(h(t, x, z)\) is determined. The trajectory is convexified in the usual way but the cost functional is convexified in a nonobvious manner. Thus, if the original value function \[ V(t, x)= \inf_{\zeta\in {\mathcal Z}} \| h(s, \xi(s)
Barron, E. N., Jensen, R.
openaire +2 more sources
Summary: The relaxation of the optimal control problem with cost functional which is the supremum in time of some function \(h(t, x, z)\) is determined. The trajectory is convexified in the usual way but the cost functional is convexified in a nonobvious manner. Thus, if the original value function \[ V(t, x)= \inf_{\zeta\in {\mathcal Z}} \| h(s, \xi(s)
Barron, E. N., Jensen, R.
openaire +2 more sources
Mathematical Notes of the Academy of Sciences of the USSR, 1991
The minimax equality \[ \inf_{t\in T}\sup_{x\in X}f(t,x) = \sup_{x\in X}\inf_{t\in T}f(t,x) \] is established in a non-standard case. Here \(T\) is a compact subinterval of the real line, but \(X\) is a compact metric space and the continuous function \(f\) is \(t\)-convex on \(T\) and satisfies a ``global maximum'' \(x\)-condition on \(X\).
Borenshteĭn, O. Yu., Shul'man, V. S.
openaire +1 more source
The minimax equality \[ \inf_{t\in T}\sup_{x\in X}f(t,x) = \sup_{x\in X}\inf_{t\in T}f(t,x) \] is established in a non-standard case. Here \(T\) is a compact subinterval of the real line, but \(X\) is a compact metric space and the continuous function \(f\) is \(t\)-convex on \(T\) and satisfies a ``global maximum'' \(x\)-condition on \(X\).
Borenshteĭn, O. Yu., Shul'man, V. S.
openaire +1 more source
SIAM Journal on Computing, 1985
This paper concerns the following problem. Given vertices \(v_ 1,...,v_ n\) with weights \(w_ 1,...,w_ n\), construct a t-ary tree with leaves \(v_ 1,...,v_ n\) in left to right order, such that if \(l_ i\) denotes the length of the path from \(v_ i\) to the root for each i, the maximum of \(w_ i+l_ i\) is minimized. A linear algorithm is presented for
Kirkpatrick, David G., Klawe, Maria M.
openaire +2 more sources
This paper concerns the following problem. Given vertices \(v_ 1,...,v_ n\) with weights \(w_ 1,...,w_ n\), construct a t-ary tree with leaves \(v_ 1,...,v_ n\) in left to right order, such that if \(l_ i\) denotes the length of the path from \(v_ i\) to the root for each i, the maximum of \(w_ i+l_ i\) is minimized. A linear algorithm is presented for
Kirkpatrick, David G., Klawe, Maria M.
openaire +2 more sources
Professionals Play Minimax [PDF]
Review of Economic Studies, 2003 Summary: The implications of the Minimax theorem are tested using natural data. The tests use a unique data set from penalty kicks in professional soccer games. In this natural setting experts play a one-shot two-person zero-sum game. The results of the tests are remarkably consistent with equilibrium play in every respect: (i) winning probabilities ...
openaire +2 more sources
Sports Economics Review, 2021
This paper tests the theory of mixed strategy equilibrium using Maradona's penalty kicks during his lifetime professional career. The results are remarkably consistent with equilibrium play in every respect: (i) Maradona's scoring probabilities are statistically identical across strategies; (ii) His choices are serially independent.
openaire +1 more source
This paper tests the theory of mixed strategy equilibrium using Maradona's penalty kicks during his lifetime professional career. The results are remarkably consistent with equilibrium play in every respect: (i) Maradona's scoring probabilities are statistically identical across strategies; (ii) His choices are serially independent.
openaire +1 more source
Mathematical Methods of Statistics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Mathematics of Operations Research, 1984
A new, general criterion is given for ensuring that a closed saddle function has a nonempty compact set of saddlepoints. Under this criterion it is shown also that every minimaximizing sequence clusters around some saddlepoint. A comparable theorem is given for semicontinuous quasi-saddle functions.
openaire +2 more sources
A new, general criterion is given for ensuring that a closed saddle function has a nonempty compact set of saddlepoints. Under this criterion it is shown also that every minimaximizing sequence clusters around some saddlepoint. A comparable theorem is given for semicontinuous quasi-saddle functions.
openaire +2 more sources
Minimax Multi-District Apportionments
2013The problem of seat apportionment in electoral systems turns out to be quite complex, since no apportionment method exists which succeeds in verifying all the principal fairness criteria. Gambarelli (1999) introduced an apportionment technique which is custom made for each case, respects Hare minimum, Hare maximum and Monotonicity and satisfies other ...
Gianfranco Gambarelli, PALESTINI, Arsen
openaire +3 more sources
Minimax ‐ Inspektionsstrategien
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1970openaire +1 more source