We provide a simple sufficient condition for the existence of a recursive upper bound on (the Pareto frontier of) the sequential equilibrium payoff set at a fixed discount factor in two-player repeated games with imperfect private monitoring. The bounding set is the sequential equilibrium payoff set with perfect monitoring and a mediator. We show that this bounding set admits a simple recursive...

Co-evolutionary techniques for evolutionary algorithms allow for the application of such algorithms to problems for which it is difficult or even impossible to formulate explicit fitness function. These techniques also maintain population diversity, allows for speciation and help overcoming limited adaptive capabilities of evolutionary algorithms. In this paper the idea of co-evolutionary multi...

A Takagi-Sugeno (T-S) Fuzzy Logic Controller (FLC) is tuned using the algorithm NSGA-II. The proposed method eliminates laborious design steps such as tuning of membership functions and conclusion table parameters. An object approach representation is used to build an adequate FLC representation. Object is an individual abstraction in order to improve crossover a mutation operators. The Genetic...

abstract atrak basin is an agricultural area in north khorasan province that the most farmers are using from groundwater resources for irrigation their crops. decreasing rainfall in recent years in this area, competition between urban, agriculture and industrial consumers has increased for water acquisition. in present study, game theory was applied for groundwater resources management of atrak...

In this work we study a routing and scheduling problem for home care business. The is composed of two conflicting objectives, therefore it as bi-objective one. We obtain the Pareto frontier small size instances using AUGMECON2 method and, bigger cases, developed an heuristic algorithm. also obtained some preliminary results that show algorithm has good behaviour.

We provide a novel characterization of the feasible payo¤ set of a general two-player repeated game with unequal discounting. In particular, we show that generically the Pareto frontier shifts outwards and the feasible payo¤ set expands in the sense of set inclusion, as the time horizon increases. This result reinforces and re…nes the insight in Lehrer and Pauzner (1999) by showing that a longe...

Abstract. Co-evolutionary techniques for evolutionary algorithms help overcoming limited adaptive capabilities of evolutionary algorithms, and maintaining population diversity. In this paper the idea and formal model of agent-based realization of predator-prey co-evolutionary algorithm is presented. The effect of using such approach is not only the location of Pareto frontier but also maintaini...

Co-evolutionary techniques for evolutionary algorithms are aimed at overcoming their limited adaptive capabilities and allow for the application of such algorithms to problems for which it is difficult or even impossible to formulate explicit fitness function. In this paper the idea of co-evolutionary multi-agent system with host-parasite mechanism for multi-objective optimization is introduced...

In the engineering design process, it is important to know the engineering trade-offs achievable under various design preferences and strategies. In this paper, a family of engineering design trade-offs are evolved from an automatic design synthesis methodology based on evolutionary computation. The complete Pareto optima frontier can be evolved by a consideration of fitness function that aggre...

In this paper we study the bilevel linear programming problem with multiple objective functions at the upper level, with particular focus on the bi-objective case. We examine some properties of this problem and propose a methodological approach based on the reformulation of the problem as a multiobjective mixed 0-1 linear programming problem. The basic idea consists in applying a reference poin...