Related papers: Strongly Stable Matchings under Matroid Constraint…
The Student-Project Allocation problem with lecturer preferences over Students (SPA-S) involves assigning students to projects based on student preferences over projects, lecturer preferences over students, and the maximum number of…
We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…
We show how fragile stable matchings are in a decentralized one-to-one matching setting. The classical work of Roth and Vande Vate (1990) suggests simple decentralized dynamics in which randomly-chosen blocking pairs match successively.…
The many-to-one stable matching problem provides the fundamental abstraction of several real-world matching markets such as school choice and hospital-resident allocation. The agents on both sides are often referred to as residents and…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
We study the many-to-many bipartite matching problem in the presence of preferences where ties, as well as lower quotas, may appear on both sides of the bipartition. The input is a bipartite graph $G=(A \cup B, E)$, where each vertex in $A…
It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset…
We discuss in details a modified variational matrix-product-state algorithm for periodic boundary conditions, based on a recent work by P. Pippan, S.R. White and H.G. Everts, Phys. Rev. B 81, 081103(R) (2010), which enables one to study…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable and the set of admissible switching signals obeys pre-specified restrictions on switches between the subsystems and dwell times on…
In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition…
We study conditions for the existence of stable and group-strategy-proof mechanisms in a many-to-one matching model with contracts if students' preferences are monotone in contract terms. We show that "equivalence", properly defined, to a…
This paper studies a matching problem in which a group of agents cooperate with agents on two sides. In environments with either nontransferable or transferable utilities, we demonstrate that a stable outcome exists when cooperations…
We consider the problem of deciding whether the solution sets of a parametrized polynomial system are toric in the sense that they admit a monomial parametrization. We focus on vertically parametrized systems, which are sparse systems where…
In variable or graph selection problems, finding a right-sized model or controlling the number of false positives is notoriously difficult. Recently, a meta-algorithm called Stability Selection was proposed that can provide reliable…
We consider a two-sided matching problem in which the agents on one side have dichotomous preferences and the other side representing institutions has strict preferences (priorities). It captures several important applications in matching…
Lately, there is a growing interest in dynamic string matching problems. Specifically, the dynamic Longest Common Factor problem has been researched and some interesting results has been reached. In this paper we examine another classic…
Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning. We study this classic problem in the fully dynamic setting, where elements…
In this paper, we consider a many-to-one matching market where ties in the preferences of agents are allowed. For this market with capacity constraints, Bonifacio, Juarez, Neme, and Oviedo proved some relationship between the set of stable…
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 popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching is a min-size popular matching. A subclass of max-size popular matchings called dominant…