Electroencephalographic single-trial analysis requires methods that are robust with respect to noise, artifacts and non-stationarity among other problems. This work contributes by developing a maxmin approach to robustify the common spatial patterns (CSP) algorithm. By optimizing the worst-case objective function within a prefixed set of the covariance matrices, we can transform the respective ...

In this paper, a new task scheduling algorithm called RASA, considering the distribution and scalability characteristics of grid resources, is proposed. The algorithm is built through a comprehensive study and analysis of two well known task scheduling algorithms, Min-min and Max-min. RASA takes advantages of the both algorithms and avoids their drawbacks. To achieve this, RASA firstly estimate...

To solve the access-balancing problem in distributed storage systems, we introduce a new combinatorial model, called MinVar model for fractional repetition (FR) codes. Since FR codes are based on graphs or set our is characterized by property that variance among sums of block-labels incident to fixed vertex minimized. This characterization different from Dau and Milenkovic's MaxMinSum while min...

We develop a tractable method to estimate multiple prior models of decision-making under ambiguity. In a representative sample of the U.S. population, we measure ambiguity attitudes in the gain and loss domains. We find that ambiguity aversion is common for uncertain events of moderate to high likelihood involving gains, but ambiguity seeking prevails for low likelihoods and for losses. We show...

The paper studies the problem of reachability for linear systems in the presence of uncertain input disturbances that may also be interpreted as the action of an adversary in a game-theoretic setting. It emphasizes the differences between reachability under open-loop and closed-loop control. The situation when observations arrive at given isolated instances of time, leads to problems of anticip...

Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...

Recently Kajii and Ui (2008) proposed to characterize interim efficient allocations in an exchange economy under asymmetric information when uncertainty is represented by multiple priors and posteriors. When agents have Bewley’s incomplete preferences, Kajii and Ui (2008) proposed a necessary and sufficient condition on the set of posteriors. However, when agents have Gilboa–Schmeidler’s MaxMin...

Recently Kajii and Ui [17] proposed to characterize interim efficient allocations in an exchange economy under asymmetric information when uncertainty is represented by multiple posteriors. When agents have Bewley’s incomplete preferences, Kajii and Ui [17] proposed a necessary and sufficient condition on the set of posteriors. However, when agents have Gilboa–Schmeidler’s MaxMin expected utili...