E. Molis, O. Gallo

The classical roommate problem highlights the challenges of forming stable coalitions
when agents pair up based on their preferences. Similarly, in negotiation problems, the
Kalai-Smorodinsky bargaining solution is a widely studied rule, but its application can
fail to ensure stability in certain contexts. This paper explores a framework where agents,
each endowed with a utility function, must form coalitions of two (roommates) and share a
preassigned endowment. We address the question: What rules of division ensure stability
in such settings? Our findings demonstrate that the Kalai-Smorodinsky solution, while
unstable in general bargaining contexts, generates stability in the roommate problem due
to the absence of preference cycles.

Keywords: stability roommate problem Kalai-Smorodinsky bargaining solution

Scheduled
Game Theory II
September 5, 2026  4:00 PM
Aula 22

Other papers in the same session

M. Domènech Blàzquez, J. M. Giménez Pradales, M. A. Puente del Campo

B. Moreno, L. C. Corchón, G. Correa


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.