相关论文: Stable Outcomes For Contract Choice Problems

The stability analysis of socioeconomic systems has been centered on answering whether small perturbations when a system is in a given quantitative state will push the system permanently to a different quantitative state. However, typically…

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 computational aspects of a possible similar scheme for assigning…

In this paper we study collective decision making on a multi-population, represented by a regular network of groups of individuals. Each group consists of a collection of players and every player can choose between two options. A group is…

We propose a new single-winner voting system using ranked ballots: Stable Voting. The motivating principle of Stable Voting is that if a candidate A would win without another candidate B in the election, and A beats B in a head-to-head…

The word stable is used to describe a situation when mathematical objects that almost satisfy an equation are close to objects satisfying it exactly. We study operator-algebraic forms of stability for unitary representations of groups and…

We study the problem of resilient strategies in the presence of uncertainty. Resilient strategies enable an agent to make decisions that are robust against disturbances. In particular, we are interested in those disturbances that are able…

Classical conditions for ensuring the robust stability of a linear system in feedback with a sector-bounded nonlinearity include small gain, circle, passivity, and conicity theorems. In this work, we present a similar stability condition,…

We study sequential bargaining between a proposer and a veto player. Both have single-peaked preferences, but the proposer is uncertain about the veto player's ideal point. The proposer cannot commit to future proposals. When players are…

The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…

In this paper, we study finite-time state consensus problems for continuous nonlinear multi-agent systems. Building on the theory of finite-time Lyapunov stability, we propose sufficient criteria which guarantee the system to reach a…

In this technical note we consider a class of multi-agent network systems that we refer to as Open Multi-Agent Systems (OMAS): in these multi-agent systems, an indefinite number of agents may join or leave the network at any time. Focusing…

We study the Stable Fixtures problem, a many-to-many generalisation of the classical non-bipartite Stable Roommates matching problem. Building on the foundational work of Tan on stable partitions, we extend his results to this significantly…

We study single-stage decision problems in which a subset of items with minimum total cost has to be selected at once from a given set of items, subject to two costs of each item -fixed and uncertain -and cardinality constraints for each…

New approaches to the study of stability of solutions of Set Differential Equations (SDEs) based on convex geometry and the theory of mixed volumes were proposed. The stability of the forms of program solutions of linear SDEs with a stable…

In this paper, I characterize minimal stable voting rules and minimal self-stable constitutions (i.e., pairs of voting rules) for societies in which only power matters. To do so, I first let players' preference profiles over voting rules…

This paper studies the formation of the grand coalition of a cooperative game by investigating its possible internal dynamics. Each coalition is capable of forcing all players to reconsider the current state of the game when it does not…

In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible parameter values. How we model this uncertainty set has a decisive influence on the…

In robust optimization, the general aim is to find a solution that performs well over a set of possible parameter outcomes, the so-called uncertainty set. In this paper, we assume that the uncertainty size is not fixed, and instead aim at…

This paper considers the problem of robust stability for a class of uncertain quantum systems subject to unknown perturbations in the system Hamiltonian. Some general stability results are given for different classes of perturbations to the…

Stochastic feedback systems give rise to a variety of notions of stability. The conditions for the stability of the median, mean, and variance stability conditions differ. These conditions can be stated explicitly for scalar discrete-time…