Abstract.The Winner Determination Problem (WDP) is crucial for modeling numerous practical and theoretical situations, and its importance has garnered significant attention from researchers. However, solving the problem is difficult due to its classification as an Np-hard problem, especially when multiple objectives are involved. Despite his challenge, a promising solution approach involves optimizing a new objective function while adhering to constraints based on a set of efficient solutions to the original problem. The utilization of Estimation Distribution Algorithms (EDA) to derive an approximate solution presents an advantage for addressing larger problem size. Remarkably, these concepts have been adapted and implemented on machine, and interesting results are obtained.
Keywords: EDA algorithms, Efficient solutions, Multiple objectives, Np-hard problems, WDP problem, Auction problem.