5 citations · 7 across the 4 of their papers we have counts for
6 papers
The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
Ildikó Schlotter, Péter Biró, Tamás Fleiner
We study housing markets as introduced by Shapley and Scarf (1974). We investigate the computational complexity of various questions regarding the situation of an agent in a ho…
Pareto optimal coalitions of fixed size
Ágnes Cseh, Tamás Fleiner, Petra Harján
We tackle the problem of partitioning players into groups of fixed size, such as allocating eligible students to shared dormitory rooms. Each student submits preferences over the o…
Complexity of Stability in Trading Networks
Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter +1
Efficient computability is an important property of solution concepts in matching markets. We consider the computational complexity of finding and verifying various solution concep…
The complexity of cake cutting with unequal shares
Ágnes Cseh, Tamás Fleiner
An unceasing problem of our prevailing society is the fair division of goods. The problem of proportional cake cutting focuses on dividing a heterogeneous and divisible resource, t…
Pareto Optimal Matchings in Many-to-Many Markets with Ties
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner +5
We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses an…
Stable matchings of teachers to schools
Katarina Cechlarova, Tamas Fleiner, David F. Manlove +1
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computati…