An algorithm for finding core in assignment games

2019-6
Küçükşenel, Serkan
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
138
views
37
downloads
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.
Two-sided matching, Assignment game, Core, Algorithm
http://www2.feas.metu.edu.tr/metusd/ojs/index.php/metusd/article/view/1048
https://hdl.handle.net/11511/58121
Department of Economics, Article

Suggestions

Core of the assignment game via fixed point methods
Küçükşenel, Serkan (2011-01-20)
This paper shows that the core outcomes of the assignment game coincides with the set of fixed points of a certain function. The lattice property of the core, as well as its non-emptiness, are proved using Tarski's fixed point theorem.
A modified algorithm for peer-to-peer security
Akleylek, Sedat; Emmungil, Levent; NURİYEV, URFAT (2007-01-01)
In this paper we present the steganographic approach to peer-to-peer systems with a modified algorithm. This gives the user a very high level of protection against being compelled to disclose its contents. Even the realization of the quantum computer cannot solve NP-hard problem in a polynomial time, a modified algorithm with steganographic use depending on Knapsack problem may make peer-to-peer systems secure.
On the reduction of Gaussian inverse Wishart mixtures
Granström, Karl; Orguner, Umut (2012-09-12)
This paper presents an algorithm for reduction of Gaussian inverse Wishart mixtures. Sums of an arbitrary number of mixture components are approximated with single components by analytically minimizing the Kullback-Leibler divergence. The Kullback-Leibler difference is used as a criterion for deciding whether or not two components should be merged, and a simple reduction algorithm is given. The reduction algorithm is tested in simulation examples in both one and two dimensions. The results presented in the ...
A study on transmit beamforming and noisy autoregressive modeling problems
Çayır, Ömer; Candan, Çağatay; Department of Electrical and Electronics Engineering (2023-1)
This thesis presents algorithms for two problems in statistical signal processing. The first problem is the transmit beamformer design under the peak-to-average power ratio (PAPR) constraint. With the aim of establishing a trade-off between the power efficiency (maximizing the average transmitted power in the main lobe) and other metrics, such as the fluctuation of power in the main lobe and the peak-sidelobe level, how the PAPR constraint affects the design problem is examined. In general, unimodular weigh...
An interactive preference based multiobjective evolutionary algorithm for the clustering problem
Demirtaş, Kerem; Özdemirel, Nur Evin; Karasakal, Esra; Department of Industrial Engineering (2011)
We propose an interactive preference-based evolutionary algorithm for the clustering problem. The problem is highly combinatorial and referred to as NP-Hard in the literature. The goal of the problem is putting similar items in the same cluster and dissimilar items into different clusters according to a certain similarity measure, while maintaining some internal objectives such as compactness, connectivity or spatial separation. However, using one of these objectives is often not sufficient to detect differ...
Citation Formats
S. Küçükşenel, “An algorithm for finding core in assignment games,” ODTÜ Gelişme Dergisi, vol. 46, no. 1, pp. 47–60, 2019, Accessed: 00, 2020. [Online]. Available: http://www2.feas.metu.edu.tr/metusd/ojs/index.php/metusd/article/view/1048.
METU IIS - Integrated Information Service open@metu.edu.tr