Using the concept of (K,L)-eigenvector, we investigate structure max-min eigenspace associated with a given eigenvalue matrix in algebra (also known as fuzzy algebra). In our approach, is split into several regions according to order relations between and components x. The resulting theory (K,L)-eigenvectors, being based on fundamental results Gondran Minoux, allows describe whole explicitly mo...

We study various discrete nonlinear combinatorial optimization problems in an online learning framework. In the first part, we address computational complexity of designing vanishing regret (and approximate regret) algorithms. provide a general reduction showing that many (min-max) polynomial time solvable not only do have regret, but also no approximation α-regret, for some α, unless NP=RP. pa...