The problem of finding a solution to a system of variational inequalities, which can be interpreted as a generalization of a convex optimization problem under arbitrary right-hand side constraint perturbations, is considered. We suggest this problem to be converted into a mixed variational...

We consider the problem of finding a point in the intersection of an affine set with a compact convex set, called a convex linear system (CLS). The conditional gradient method is known to exhibit a sublinear rate of convergence. Exploiting the special structure of (CLS), we prove that the...

The purpose of this paper is devoted to the least element problems of feasible sets for vector complementarity problems under certain conditions. We generalize the notion of a Z-map due to Riddell to the set-valued case. Some conditions of the feasible set being a sublattice are presented and...

In this paper, a new trust region method is presented for general constrained optimization problem. In this algorithm, the trial step is obtained by solving two quadratic programming problems with bound constraints. The algorithm is implementable easily. Then we prove that the method is globally...

An open question in the study of quasiconvex function is the characterization of the class of functions which are sum of quasiconvex functions. In this paper we restrict our attention to quasiconvex radiant functions, i.e. those whose level sets are radiant as well as convex and deal with the...

Cooperative games on antimatroids are cooperative games in which coalition formation is restricted by a combinatorial structure which generalizes permission structures. These games group several well-known families of games which have important applications in economics and politics. The current...

In this paper we consider a cost allocation problem arising in a consortium for urban solid wastes collection and disposal. A classical allocation rule is the proportional division according to the volume of wastes collected; here we propose a different allocation method, rooted in game theory,...

We present a novel simulation-based algorithm, as an extension of the well-known policy iteration algorithm, by combining multi-policy improvement with a distributed simulation-based voting policy evaluation, for approximately solving Markov Decision Processes (MDPs) with infinite horizon...

By focusing on the protectionist tendency found in the design of voting games, a thorough analysis is provided for the role of blocking coalitions in a simple game. We characterize those blocking families that univocally determine the game, and show that otherwise at least three games share a...

In this paper we analyse the equilibrium structure for a particular type of electricity market. We consider a market with two generators offering electricity into a pool. Generators are centrally dispatched, with cheapest offers used first. The pool price is determined as the highest-priced...