International Conference «Mathematical and Informational Technologies, MIT-2013»
(X Conference «Computational and Informational Technologies for Science,
Engineering and Education»)

Vrnjacka Banja, Serbia, September, 5–8, 2013

Budva, Montenegro, September, 9-14, 2013

Milosevic R.  

An attempt mathematical formalization of the problem of stable marriages

Problem stable Ark is a topic that should rasvetljavati the interdisciplinary perspective of personality psychology, ethics, aesthetics, sociology, economics and other fields of science. Remarkably, the stable marriages problem can be formalized with mathematical and computer aspects. This paper is an attempt to formalize the mathematical problem of stable marriages. In this sense, we will use some elements of various mathematical disciplines. First, we illustrate this problem through meetings disjuktnih boys and girls as potential couples for marriage as stable. Then, we'll look over this problem with a two-variable function, the analytical tables and graphically. We will use arrays, number theory and combinatorics elements. List of choices of future spouses will be shown in the form of pseudo-mathematical language, to the algorithms in the form of the main theorem about the problem of stable marriages. At the end of the paper will show the four things with the evidence derived from the theorem. The objective and significance of this work is to treat the problem of exact stable marriages that are the foundation of a healthy family, and the family is the basic cell of a healthy and prosperous society.
Keywords: marriage, family, society, mathematics, algorithm

To reports list

© 1996-2019, Institute of computational technologies of SB RAS, Novosibirsk