Experiments show that in sequential bargaining games (SBG), subjects usually deviate from game-theoretic predictions. Previous explanations have focused on considerations of fairness in the offers, and social utility functions have been formulated to model the data. However, a recent explanation...

Qualitative coalitional games (QCG) are representations of coalitional games in which self interested agents, each with their own individual goals, group together in order to achieve a set of goals which satisfy all the agents within that group. In such a representation, it is the strategy of...

We conduct a laboratory experiment and parallel computational adaptive agent simulations on unraveling of contract dates in two-sided matching markets inspired by the entry-level professional labor markets for medical interns in Britain. Experimental design consists of decentralized and mixed...

We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph G = (N;E), with an integer vertex capacity function b and an edge weighting w. The set N consists of a number of players that are to form a set M is a subset of E of 2-player...

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 other individual students. We study several settings, which differ in the size of the rooms to be filled, the...

We study the classical, two-sided stable marriage problem under pairwise preferences. In the most generalsetting, agents are allowed to express their preferences as comparisons of any two of their edges and they alsohave the right to declare a draw or even withdraw from such a comparison. This...

In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A matching is called stable if it is not blocked by any pair of agents, who mutually prefer each other to their...

The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case of uncoordinated processes in stable allocation...

Recent debate in the medical literature has brought attention to issues with the pre-match interview process for residency and fellowship positions at hospitals. However, little is known about the economics of this decentralized process. In this paper, I build a game-theoretic model in which...

We report experimental findings on the role of charitable promises in bargaining settings. We vary the enforceability of such promises within variants of ultimatum games where the proposer suggest a split between himself, the responder and a char-itable donation. By reneging on initial pledges,...