?
College admissions with stable score - limits
Péter Biró, Kiselgof S. G.
A common feature of the Hungarian, Irish, Spanish and Turkish higher education admission systems is that the students apply for programmes and they are ranked according to their scores. Students who apply for a programme with the same score are in a tie. Ties are broken by lottery in Ireland, by objective factors in Turkey (such as date of birth) and other precisely defined rules in Spain. In Hungary, however, an equal treatment policy is used, students applying for a programme with the same score are all accepted or rejected together. In such a situation there is only one question to decide, whether or not to admit the last group of applicants with the same score who are at the boundary of the quota. Both concepts can be described in terms of stable score-limits. The strict rejection of the last group with whom a quota would be violated corresponds to the concept of H-stable (i.e. higher-stable) score-limits that is currently used in Hungary. We call the other solutions based on the less strict admission policy as L-stable (i.e. lower-stable) score-limits. We show that the natural extensions of the Gale-Shapley algorithms produce stable score-limits, moreover, the applicant-oriented versions result in the lowest score-limits (thus optimal for students) and the college-oriented versions result in the highest score-limits with regard to each concept. When comparing the applicant-optimal H-stable and L-stable score-limits we prove that the former limits are always higher for every college. Furthermore, these two solutions provide upper and lower bounds for any solution arising from a tie-breaking strategy. Finally we show that both the H-stable and the L-stable applicant-proposing scorelimit algorithms are manipulable.
Language:
English
Publication based on the results of:
Kravtsova M., Musaev A. U., Welzel C., / Series "SSRN Working Paper Series". 2026.
Elaborating on Welzel et al.'s "Cool Water Theory," our study zooms into the more limited (albeit still varied) framework conditions of Russia's huge territory. Within Russia's confines, we examine how the combination of moderately cool seasons with steady rain (i.e., Cool Water) affects sub-national areas' contemporary societal progress in two modernization indicators: material prosperity in ...
Added: June 3, 2026
Синяков А. А., Зверева В., Шелованова Т. И., / Центральный банк Российской Федерации. Серия 132 / 2024 "Серия докладов об экономических исследованиях". 2024. № 132.
At the end of 2023, Russia updated its Strategy for Improving Financial Literacy and Developing Financial Culture Until 2030. Unlike the previous strategy, the current strategic goals include not only financial literacy but also financial culture. ‘Culture’ is normative and socially preferred behaviour. The updated strategy brings into focus the relationship between financial literacy and responsible financial behaviour. To explore this relationship, the authors rely on data from the All-Russian Survey of Consumer Finance (2020 and 2022). Socially ...
Added: June 1, 2026
Vorchik A., / SSRN. Серия Social Science Research Network "Social Science Research Network". 2026.
This work is devoted to a theoretical explanation of the Easterlin paradox, according to which long-term economic growth does not make average level of people's happiness increasing. By happiness, we mean the intensity of emotions people experience while comparing their new income with its expected value, or the target income with its original value. In the first case, ...
Added: May 31, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Ustyuzhanin V., / Series Econometrics "arxiv". 2026.
This paper proposes Covariate-Balanced Weighted Stacked Difference-in-Differences (CBWSDID), a design-based extension of weighted stacked DID for settings in which untreated trends may be conditionally rather than unconditionally parallel. The estimator separates within-subexperiment design adjustment from across-subexperiment aggregation: matching or weighting improves treated-control comparability within each stacked subexperiment, while the corrective stacked weights of Wing et ...
Added: April 3, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Vorchik A., / Social Science Research Network. Серия SSRN Working Paper Series "SSRN Working Paper Series". 2026.
This article is devoted to the phenomenon of intrinsic motivation, to understand which two models are proposed. We study how positive/negative intrinsic motivation to work (experienced utility) affects worker's individual labour supply (model I) and the amount of effort they exert (model II). In model I, we use intrinsic motivation to explain the positive/negative slope ...
Added: March 15, 2026
Vorchik A., Мамышев М. А., / Series Social Science Research Network "Social Science Research Network". 2025.
In this paper, we develop a formal mathematical model aimed to explain the Dunning-Kruger effect that beginners systematically overestimate their own competence in various fields of knowledge and activity. We argue that the Dunning-Kruger effect arises from the emotional nature of confidence combined with unknown unknowns that it simply can not take into account due ...
Added: February 11, 2026
Musaev A. U., Vorchik A., / Series Social Science Research Network "Social Science Research Network". 2026.
This paper attempts to model the evolutionary theory of modernization and democratization. The model reflects the key provisions of R. Inglehart and C. Welzel's theory and provides a microfoundation for the adaptation of subjective values to the objective importances of the survival factors and the structure of the labour markets from the perspective of evolutionary ...
Added: February 10, 2026
Antsygina A., Teteryatnikova M., Tremewan J. C. et al., / Series "SSRN Working Paper Series". 2025.
Many competitive environments allow for a third party to be indirectly involved by supporting one or both sides in the conflict. Such support can come from trade partners, colleagues, or allies, who can in turn benefit from a supported party's success. We use theory and an experiment to investigate how support relationships develop endogenously in ...
Added: January 31, 2026
Дистель Р., М.: МЦНМО, 2024.
С момента выхода первого издания на английском языке в 1997 году книга известного математика, профессора Гамбургского университета Рейнгарда Дистеля стала основным учебником по теории графов во многих университетах, выдержав к настоящему времени пять изданий, перевод последнего из которых предлагается читателю. Уникальность учебника в его глубине при относительно небольшом объёме: в книге найдутся задачи как доступные ...
Added: January 25, 2026
Akhmedova A., / Series "SSRN Working Paper Series". 2026.
The study explores a psychological phenomenon of inaction inertia-avoiding action after missing a more favourable opportunity. Unlike action inertia (e.g.,sunk costs effect), inaction inertia has been less studied, particularly in economic contexts. Considering the reference dependent nature of the phenomenon, I build on the work of Kőszegi and Rabin (2006) to examine how past experiences ...
Added: January 23, 2026
Beaudou L., Echeverría H., Foucaud F. et al., Procedia Computer Science 2025 Vol. 273 P. 86–93
We prove that the recognition of exact cubes of trees can be done in polynomial time. More precisely, the exact distance power of a graph is a refinement of the more usual notion of graph power. Given a graph G and a positive integer p, the exact distance pth power of G is the graph G#p on the same vertex set where two vertices ...
Added: December 3, 2025
Karpov A., Automation and Remote Control 2022 Vol. 83 P. 1329–1354
A survey of papers on practically significant restrictions on the preference profile of a collective is carried out, including single-peaked preferences, group-separable preferences, preferences with the single-crossing property, and Euclidean preferences and their extensions. Both ordinal and dichotomous preferences are considered. For structured preferences, we present characterization in terms of forbidden subprofiles and the probability ...
Added: October 31, 2022
А. В. Карпов, Автоматика и телемеханика 2022 № 9 С. 3–35
Проведен обзор работ по практически значимым ограничениям на профиль предпочтений коллектива: однопиковые предпочтения, сепарабельные предпочтения, предпочтения со свойством единственного пересечения, евклидовы предпочтения и их расширения. Рассмотрены как ординальные, так и дихотомические предпочтения. Для структурированных предпочтений представлена характеризация через запрещенные подпрофили и вероятность появления профиля с заданным свойством. Для сепарабельных предпочтений описан алгоритм построения иерархического дерева. ...
Added: September 15, 2022
Avdoshin S. M., Набебин А. А., М.: ДМК Пресс, 2019.
The book contains the necessary information from the algorithm theory, graph theory, combinatorics. It is considered partially recursive functions, Turing machines, some versions of the algorithms (associative calculus, the system of substitutions, grammars, Post's productions, Marcov's normal algorithms, operator algorithms). The main types of graphs are described (multigraphs, pseudographs, Eulerian graphs, Hamiltonian graphs, trees, bipartite ...
Added: August 24, 2018
Babenko M. A., Artamonov S., , in: 28th International Symposium on Algorithms and Computation, ISAAC 2017Vol. 92.: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2017. P. 1–12.
Let G = (V,E) be an undirected graph, T ⊆ V be a set of terminals. Then a natural combinatorial problem consists in finding the maximum number of vertex-disjoint paths connecting distinct terminals. For this problem, a clever construction suggested by Gallai reduces it to computing a maximum non-bipartite matching and thus gives an O ( m ...
Added: March 1, 2018
Sofya Kiselgof, Procedia Computer Science 2014 Vol. 31 P. 807–813
We investigate models of two-sided matching markets without transfers. Examples of such markets include marriage market, universities-applicants market and others. Gale and Shapley in 1962 first introduced this kind of problems in the literature. They considered one-to-one and one-to-many markets, where preferences of individuals on the one side over individuals on the other side were ...
Added: January 23, 2015
Sofya Kisel'gof, Automation and Remote Control 2014 Vol. 75 No. 6 P. 1069–1077
We consider an extension of the classical model of generalized Gale-Shapley matchings. The model describes a two-sided market: on one side, universities each of which has a restriction on the number of enrolled students; on the other side, applicants each of which can get a single place in the university. Both applicants and universities have ...
Added: October 23, 2014
Péter Biró, Sofya Kiselgof, Central European Journal of Operations Research 2015 Vol. 23 No. 4 P. 727–741
A common feature of the Hungarian, Irish, Spanish and Turkish higher education admission systems is that students apply for programmes and are ranked according to their scores. Students who apply for a programme with the same score are tied. Ties are broken by lottery in Ireland, by objective factors in Turkey (such as date of ...
Added: October 23, 2014
Kiselgof S. G., Автоматика и телемеханика 2014 № 6 С. 103–114
Рассмотрено расширение классической модели обобщенных паросочетаний Гейла–Шепли. Модель описывает двусторонний рынок: с одной стороны – вузы, каждый из которых имеет ограничение по числу зачисляемых студентов; с другой стороны – абитуриенты, каждый из которых может получить одно место в вузе. И абитуриенты, и вузы высказывают предпочтения относительно желаемого распределения. Предполагается, что каждый абитуриент выстраивает линейный порядок на множестве желаемых вузов, а каждый ...
Added: October 17, 2014
Kiselgof S. G., , in: Game Theory and Management. Collected abstracts of papers presented on the Fifth International Conference Game Theory and Management.: St. Petersburg: Graduate School of Management, St. Petersburg University, 2011. P. 119–121.
Matching problem with preferences being simplest semiorders is analysed. It is proved that a stable matching always exists. Furthermore, for any stable matching there exists a linear extension of preferences, which does not sontradict stability of a matching. In the college admission problem common goal is to find student-optimal stable matching. We provide a simple ...
Added: March 21, 2013