An Algorithm for Finding Core in Assignment Games

2019-06-01
Küçükşenel, Serkan
Show full item record
39
views
0
downloads
http://www2.feas.metu.edu.tr/metusd/ojs/index.php/metusd/issue/view/88/showToc
https://hdl.handle.net/11511/73900
METU Studies in Development
Unclassified, Article

Suggestions

An algorithm for finding core in assignment games
Küçükşenel, Serkan (Orta Doğu Teknik Üniversitesi (Ankara, Turkey), 2019-6)
This paper presents an algorithm that finds all core payoffs in the assignment games with money. Our algorithm provides an easy way to reach all core outcomes using the similar fixed point construction arguments from the two-sided matching literature.
An Evolutionary Algorithm for the Multi-objective Multiple Knapsack Problem
SOYLU, Banu; Köksalan, Mustafa Murat (2009-06-26)
In this study, we consider the multi-objective multiple knapsack problem (MMKP) and we adapt our favorable weight based evolutionary algorithm (FWEA) to approximate the efficient frontier of MMKP. The algorithm assigns fitness to solutions based on their relative strengths as well as their non-dominated frontiers. The relative strength is measured based on a weighted Tchebycheff distance from the ideal point where each Solution chooses its own weights that minimize its distance from the ideal point. We carr...
An Evolutionary Algorithm for Finding Efficient Solutions in Multi-Attribute Auctions
Koksalan, Murat; Karakaya, Gülşah (2014-05-01)
There is a growing interest in electronic auctions. Many researchers consider a single-attribute, although auctions are multi-attribute in nature in practice. Addressing multiple attributes increases the difficulty of the problem substantially. We develop an evolutionary algorithm (EA) for multi-attribute multi-item reverse auctions. We try to generate the whole Pareto front using the EA. We also develop heuristic procedures to find several good initial solutions and insert those in the initial population o...
An evolutionary algorithm for multiple criteria problems
Soylu, Banu; Köksalan, Murat; Department of Industrial Engineering (2007)
In this thesis, we develop an evolutionary algorithm for approximating the Pareto frontier of multi-objective continuous and combinatorial optimization problems. The algorithm tries to evolve the population of solutions towards the Pareto frontier and distribute it over the frontier in order to maintain a well-spread representation. The fitness score of each solution is computed with a Tchebycheff distance function and non-dominating sorting approach. Each solution chooses its own favorable weights accordin...
An efficient transitive closure algorithm for distributed databases
Toroslu, İsmail Hakkı (1993-01-01)
© 1993 IEEE.Because most of the recognizable queries in deductive databases can be transformed into transitive-closure (TC) problem, the development of efficient algorithms to process the different forms of TC problems within the context of large database systems has recently attracted a large amount of research efforts. However, the parallelization of the computation of TC is still a new issue and there are only a few and recent parallel TC algorithms. Most of these parallel algorithms mere developed for s...
Citation Formats
S. Küçükşenel, “An Algorithm for Finding Core in Assignment Games,” METU Studies in Development, pp. 47–60, 2019, Accessed: 00, 2021. [Online]. Available: http://www2.feas.metu.edu.tr/metusd/ojs/index.php/metusd/issue/view/88/showToc.
METU IIS - Integrated Information Service open@metu.edu.tr