Related papers: Stable Outcomes For Contract Choice Problems

Algorithmic stability is a central concept in statistics and learning theory that measures how sensitive an algorithm's output is to small changes in the training data. Stability plays a crucial role in understanding generalization,…

Each period, two players bargain over a unit of surplus. Each player chooses between remaining flexible and committing to a take-it-or-leave-it offer at a cost. If players' committed demands are incompatible, then the current-period surplus…

In many economic contexts, agents from a same population team up to better exploit their human capital. In such contexts (often called "roommate matching problems"), stable matchings may fail to exist even when utility is transferable. We…

In the multidimensional stable roommate problem, agents have to be allocated to rooms and have preferences over sets of potential roommates. We study the complexity of finding good allocations of agents to rooms under the assumption that…

We study a matching problem between agents and public goods, in settings without monetary transfers. Since goods are public, they have no capacity constraints. There is no exogenously defined budget of goods to be provided. Rather, each…

The Stable Roommates problems are characterized by the preferences of agents over other agents as roommates. A solution is a partition of the agents into pairs that are acceptable to each other (i.e., they are in the preference lists of…

In classic robust optimization, it is assumed that a set of possible parameter realizations, the uncertainty set, is modeled in a previous step and part of the input. As recent work has shown, finding the most suitable uncertainty set is in…

Competing bimodal coalitions among a group of actors are discussed. First, a model from political sciences is revisited. Most of the model statements are found not to be contained in the model. Second, a new coalition model is built. It…

The formal study of coalition formation in multi-agent systems is typically realized in the framework of hedonic games, which originate from economic theory. The main focus of this branch of research has been on the existence and the…

We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of…

We consider the problem of state selection for a stochastic system, initially in an unstable stationary state, when multiple metastable states compete for occupation. Using path-integral techniques we derive remarkably simple and accurate…

We analyse a coalition formation game between strategic service providers of a congestible service. The key novelty of our formulation is that it is a constant sum game, i.e., the total payoff across all service providers (or coalitions of…

Some argue that political stability is best served through a two-party system. This study refutes this. The author mathematically defines the stability and rigidity of electoral systems comprised of any quantity of electors and parties. In…

This paper studies multilateral matching in which agents may negotiate contracts within any coalition. We assume scale economies such that an agent substitutes some existing contracts with new ones only if the latter involve a set of…

The classic two-sided many-to-one job matching model assumes that firms treat workers as substitutes and workers ignore colleagues when choosing where to work. Relaxing these assumptions may lead to nonexistence of stable matchings.…

We study how governments promote social welfare through the design of contracting environments. We model the regulation of contracting as default delegation: the government chooses a delegation set of contract terms it is willing to…

We study stability in additively separable hedonic games when coalition sizes have to respect fixed size bounds. We consider four classic notions of stability based on single-agent deviations, namely, Nash stability, individual stability,…

Coordination games admit two types of equilibria: pure equilibria, where all players successfully coordinate their actions, and mixed equilibria, where players frequently experience miscoordination. The existing literature shows that under…

This paper presents weakened notions of corewise stability and setwise stability for matching markets where agents have substitutable choice functions. We introduce the concepts of worker-quasi-core, firm-quasi-core, and worker-quasisetwise…

We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…