Core of the assignment game via fixed point methods

Date

2011-01-20

Author

Küçükşenel, Serkan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

128
views

0
downloads

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.

Subject Keywords

Lattice structure, Core, Stability, Assignment game, Two-sided matching

URI

https://hdl.handle.net/11511/32783

Journal

JOURNAL OF MATHEMATICAL ECONOMICS

DOI

https://doi.org/10.1016/j.jmateco.2011.01.003

Collections

Department of Economics, Article

Suggestions

OpenMETU
Core

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.
Stability in non-autonomous periodic systems with grazing stationary impacts Akhmet, Marat (2017-01-01) This paper examines impulsive non-autonomous periodic systems whose surfaces of discontinuity and impact functions are not depending on the time variable. The W-map which alters the system with variable moments of impulses to that with fixed moments and facilitates the investigations, is presented. A particular linearizion system with two compartments is utilized to analyze stability of a grazing periodic solution. A significant way to keep down a singularity in linearizion is demonstrated. A concise review...
Open problems in CEM: A new look at the stability analysis of the finite-difference time-domain method Ergül, Özgür Salih; Özakın, M. Burak (2014-01-01) The stability analysis of a numerical time-domain method plays a crucial role in well understanding the numerical behavior of the algorithm. The stability analysis should therefore be investigated in all senses. In this work, a new look at the stability analysis of the Finite-Difference Time-Domain Method is given. A novel link is constructed between the numerical-dispersion analysis and the stability analysis by using the sampled values of the unit space and time steps. Unification of these two analyses th...
VARIATION OF LYAPUNOV METHOD FOR DYNAMIC-SYSTEMS ON TIME SCALES KAYMAKCALAN, B; RANGARAJAN, L (Elsevier BV, 1994-07-15) A new comparison theorem that connects the solutions of perturbed and unperturbed dynamic systems in a manner useful to the theory of perturbations is given and this comparison theorem is employed as a stability criterion to compare the asymptotic behaviors of perturbed and unperturbed systems. It is further shown by means of both theory and numerical computation that time scales do offer a unification in order to emphasize the better asymptotic behavior of perturbed systems in both continuous and discrete ...
Topology of the complement of a real algebraic curve in ℂP2 Finashin, Sergey (1984-07-01) In this paper we consider the problem of the disposition of the set of points of a nonsingular real algebraic curve of given degree in ℂP2. The homotopy description of the complement of such a curve in ℂP2 is the first step toward solving the problem of disposition mentioned. In the case of an arbitrary curve we are able to prove that the complement indicated is homotopy equivalent with a three-dimensional cell complex of special form. For a certain class of curves the complex turns out to be two-dimensiona...

Citation Formats

S. Küçükşenel, “Core of the assignment game via fixed point methods,” JOURNAL OF MATHEMATICAL ECONOMICS, pp. 72–76, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32783.