Individuals are randomly matched to play a 2 × 2 coordination game where the Pareto efficient and risk dominant equilibria differ. Players choose strategies by imitating the strategy of the most successful individual they observe. So, while individuals interact globally, their observation and hence imitation, as determined by their social network, may be local. When all individuals observe each...

GENE_ARCH is an evolution-based Generative Design System that uses adaptation to shape energy-efficient and sustainable architectural solutions. The system applies goal-oriented design, combining a Genetic Algorithm (GA) as the search engine, with DOE2.1E building simulation software as the evaluation module. The GA can work either as a standard GA or as a Pareto GA, for multicriteria optimizat...

We propose a new Pareto Local Search Algorithm for the many-objective combinatorial optimization. Pareto Local Search proved to be a very effective tool in the case of the bi-objective combinatorial optimization and it was used in a number of the state-of-the-art algorithms for problems of this kind. On the other hand, the standard Pareto Local Search algorithm becomes very inefficient for prob...

The theory of implementation abounds with mechanisms with intricate systems of rewards and punishments off-the-equilibrium path. Generally, it is not in the designer’s best interest to go through with the reward/punishment in the “subgame” arising from some disequilibrium play. This would make the mechanism’s outcome function non-credible. We define a notion of credible implementation and, in t...

Many decision making problems can be formulated as multi-objective optimization problems (MOP). There hardly exists the solution that optimizes all objective functions in MOP, and then the concept of Pareto optimal solution (or efficient solution) is introduced. Usually, there exist a lot of Pareto optimal solutions, which are considered as candidates of final decision making solution. It is an...

Domains of individual preferences for which the well-known impossibility Theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. First, we introduce necessary and sufficient conditions for a domain to admit non-dictatorial, Pareto efficient and either strategy-proof or Maskin monotonic social choice rules. Next, to comprehend the limitations the two Theorems imply fo...

In bilateral Negotiation Analysis, the literature often considers the case of complete information. In this context, since the negotiators know the value functions of both parties, it is not difficult to calculate the Pareto frontier and the Pareto efficient solutions for the negotiation. Thus rational negotiators can reach agreement on this frontier. However, these approaches are not applied i...

The denoising of a natural image corrupted by noise is a classical problem in image processing. In this paper, an efficient algorithm of image denoising based on multi-objective optimization in discrete wavelet transform (DWT) domain is proposed, which can achieve the Pareto optimal wavelet thresholds. First, the multiple objectives for image denoising are presented, then the relation between t...

A tabu search algorithm is proposed for finding the Pareto solutions of multiobjective optimal design problems. In this paper, the contact theorem is used to evaluate the Pareto solutions. The ranking selecting approach and the fitness sharing function are also introduced to identify new current points to begin every iteration cycle. Detailed numerical results are reported in this paper to demo...

A model is presented for analyzing Pareto-efficient build-operate-transfer toll road contracts. The formulation simultaneously allows maximizing social welfare and private profit when road users vary in their value-of-time (VOT). The failure rate and mean residual functions of the VOT distribution are used to characterize Pareto-efficient solutions. Service quality, measured in terms of the vol...