Related papers: Equivalent Choice Functions and Stable Mechanisms

Focusing on the bipartite Stable Marriage problem, we investigate different robustness measures related to stable matchings. We analyze the computational complexity of computing them and analyze their behavior in extensive experiments on…

We study the evolution of preferences in multi-population settings that allow matches across distinct populations. Each individual has subjective preferences over potential outcomes, and chooses a best response based on his preferences and…

We study many-to-one matching problems between institutions and individuals, where each institution may be matched to multiple individuals. The matching market includes couples, who view pairs of institutions as complementary. Institutions'…

In this paper, we develop the theory of equivariant motivic homotopy theory, both unstable and stable. While our original interest was in the case of profinite group actions on smooth schemes, we discuss our results in as broad a setting as…

We consider a family of conditional nonlinear expectations defined on the space of bounded random variables and indexed by the class of all the sub-sigma-algebras of a given underlying sigma-algebra. We show that if this family satisfies a…

This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the best service available. This is the case for most existing…

We consider the stability of matchings when individuals strategically submit preference information to a publicly known algorithm. Most pure Nash equilibria of the ensuing game yield a matching that is unstable with respect to the…

We consider the stable assignment problem on a graph with nonnegative real capacities on the edges and quotas on the vertices, in which the preferences of agents are given via diversifying choice functions. We prove that for any input of…

We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…

We show that a large effective number of commodities can be a source of equilibrium stability and uniqueness: expanding substitution opportunities strengthens aggregate substitution effects. We study finite dated-commodity exchange…

An action trace is a function naturally associated to a probability measure preserving action of a group on a standard probability space. For countable amenable groups, we characterise stability in permutations using action traces. We…

Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class consists precisely of…

We consider multi-item exchange markets in which agents want to receive one of their target bundles of resources. The model encompasses well-studied markets for kidney exchange, lung exchange, and multi-organ exchange. We identify a general…

We study a many-to-one matching model inspired by school choice, where schools evaluate applicants using multiple rankings rather than a single priority order. We model each school's evaluation with social choice criteria to reflect the…

We consider a stochastic optimal control problem in a market model with temporary and permanent price impact, which is related to an expected utility maximization problem under finite fuel constraint. We establish the initial condition…

This paper develops a framework to study the statistical power of revealed-preference tests. With randomly sampled budgets and mild smoothness of demand, statistical learning implies that any model consistent with the data must approximate…

We study competitive equilibria in the classic Shapley-Shubik assignment model with indivisible goods and unit-demand buyers, with budget constraints: buyers can specify a maximum price they are willing to pay for each item, beyond which…

We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups. We show that if multiple groups can simultaneously engage…

In a multi-agent system, unconditional (multiple) consensus is the property of reaching to (multiple) consensus irrespective of the instant and values at which states are initialized. For linear algorithms, occurrence of unconditional…

In this paper, we study the continuity of expected utility functions, and derive a necessary and sufficient condition for a weak order on the space of simple probabilities to have a continuous expected utility function. We also verify that…