Abstract This paper addresses the problem of approximating set all solutions for Multi-objective Markov Decision Processes. We show that in vast majority interesting cases, number is exponential or even infinite. In order to overcome this difficulty we propose approximate by means a limited precision approach based on White’s multi-objective value-iteration dynamic programming algorithm. prove ...

Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise, such as typing (covariance vs. contravariance of the arguments), polymorphism on multiple arguments (lack of multi-methods) etc. The purpose of this paper is to demonstrate how those problems are either solved, or nonexistent in the Common Lisp Object System (Clos). Several solutions for ...

Multi-objective evolutionary algorithms (MOEAs) have been successfully applied for the numerical treatment of multi-objective optimization problems (MOP) during last three decades. One important task within MOEAs is archiving (or selection) computed candidate solutions, since one can expect that an MOP has infinitely many solutions. We present and analyze in this work ArchiveUpdateHD, which a b...