Related papers: Pseudo-Substitutability: A Maximal Domain for Pair…
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 introduce and study the notion of $\star$-stability with respect to a semistar operation $\star$ defined on a domain $R$; in particular we consider the case where $\star$ is the $w$-operation. This notion allows us to generalize and…
We provide a problem definition of the stable marriage problem for a general number of parties $p$ under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural…
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…
We consider an occupation market in which preferences of members are treated as non linear general increasing functions. The arrangement of members is separated into two non over-lapping sets, set of workers and set of firms. We consider…
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 the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A are given but the preferences of the agents in B are…
We study the stable marriage problem in the partial information setting where the agents, although they have an underlying true strict linear order, are allowed to specify partial orders. Specifically, we focus on the case where the agents…
Submodularity is a discrete domain functional property that can be interpreted as mimicking the role of the well-known convexity/concavity properties in the continuous domain. Submodular functions exhibit strong structure that lead to…
We present a polynomial-time $\frac{3}{2}$-approximation algorithm for the problem of finding a maximum-cardinality stable matching in a many-to-many matching model with ties and laminar constraints on both sides. We formulate our problem…
We consider a variant of socially stable marriage problem where preference lists may be incomplete, may contain ties and may have bounded length. In real world application like NRMP and Scottish medical matching scheme such restrictions…
When composing multiple preferences characterizing the most suitable results for a user, several issues may arise. Indeed, preferences can be partially contradictory, suffer from a mismatch with the level of detail of the actual data, and…
Two-sided matching markets, environments in which two disjoint groups of agents seek to partner with one another, arise in several contexts. In static, centralized markets where agents know their preferences, standard algorithms can yield a…
Max-stability is the property that taking a maximum between two inputs results in a maximum between two outputs. We study max-stability with respect to first-order stochastic dominance, the most fundamental notion of stochastic dominance in…
Stable event structures, and their duality with prime algebraic domains arising as partial orders of configurations, are a landmark of concurrency theory, providing a clear characterisation of causality in computations. They have been used…
We study the object reallocation problem under strict preferences. On the unrestricted domain, Ekici (2024) showed that the Top Trading Cycles (TTC) mechanism is the unique mechanism that is individually rational, pair efficient, and…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
This paper studies matching markets in the presence of middlemen. In our framework, a buyer-seller pair may either trade directly or use the services of a middleman; and a middleman may serve multiple buyer-seller pairs. Direct trade…
This paper considers discrete-time switched systems under dwell-time switching and in the presence of saturation nonlinearity. Based on Multiple Lyapunov Functions and using polytopic representation of nested saturation functions, a…
In this paper we consider a shape optimization problem in which the data in the cost functional and in the state equation may change sign, and so no monotonicity assumption is satisfied. Nevertheless, we are able to prove that an optimal…