2 Graph kernels 2 2.1 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 The Spectrum Kernel . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3 The Tanimoto Kernel . . . . . . . . . . . . . . . . . . . . . . . . 3 2.4 The MinMax Kernel . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.5 The Marginalized Kernel . . . . . . . . . . . . . . . . . . . . . . . 3 2.6 ...

Abstract: In this paper we consider the rational eigenvalue problem governing the relevant energy levels and wave functions of a three dimensional quantum dot. We present iterative projection methods of Arnoldi and of Jacobi–Davidson type for computing a few eigenpairs of this system. Solving the projected nonlinear eigenvalue problems we take advantage of a minmax characterization of the eigen...

We study best response dynamics in continuous time for continuous concave-convex zero-sum games and prove convergence of its trajectories to the set of saddle points, thus providing a dynamical proof of the minmax theorem. Consequences for the corresponding discrete time process with small or diminishing step-sizes are established, including convergence of the fictitious play procedure.

This paper discusses the minimax location problem with fuzzy locations of customers on a plane bounded by a convex polygon under a minmax criterion. Three types of fuzzy programming are presented for this problem according to different criteria, and Euclidean distances are assumed as the scenario. For solving the proposed models, a hybrid intelligent algorithm is designed.

During the last years nonlinear eigenvalue problems of the type T (λ)x = 0 became more and more important in many applications with the rapid development of computing performance. In parallel the minmax theory for symmetric nonlinear eigenvalue problems was developed which reveals a strong connection to corresponding linear problems. We want to review the current theory for symmetric nonlinear ...

The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard (TSP), that there are m (m>1) salesmen to visit cities. In this paper, we address mTSP with both minsum objective and minmax objective, which aims at minimizing total length tours longest tour among all tours, respectively. We propose an iterated two-stage heuristic algorithm called ITSHA for mTSP. Each ...

We study repeated games with private monitoring. We prove the folk theorem with discounting for all games assuming that the monitoring is almost perfect and the payoffs satisfy the full-dimensionality condition. We assume no cheap-talk communication between players, no public randomization, and we allow for minmax payoffs in mixed strategies.