Related papers: Matching with Generalized Sequential Choice Rules
We consider the pattern formation problem in coupled identical systems after the global synchronized state becomes unstable. Based on analytical results relating the coupling strengths and the instability of each spatial mode (pattern) we…
The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…
Autoregressive models use chain rule to define a joint probability distribution as a product of conditionals. These conditionals need to be normalized, imposing constraints on the functional families that can be used. To increase…
Modeling joint probability distributions is an important task in a wide variety of fields. One popular technique for this employs a family of multivariate distributions with uniform marginals called copulas. While the theory of modeling…
Recommender systems play a crucial role in mediating our access to online information. We show that such algorithms induce a particular kind of stereotyping: if preferences for a set of items are anti-correlated in the general user…
This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…
Stable matching theory is the foundation of centralized clearinghouses worldwide, from school choice programs to medical residency allocations. However, incorporating complex distributional goals-such as multi-dimensional diversity quotas…
We study the existence of stable matchings when agents have choice correspondences instead of preference relations. We extend the framework of \cite{chambers2017choice} by weakening the path independence assumption. For many-to-many…
The matching literature often recommends market centralization under the assumption that agents know their own preferences and that their preferences are fixed. We find counterevidence to this assumption in a quasi-experiment. In Germany's…
In a stable matching setting, we consider a query model that allows for an interactive learning algorithm to make precisely one type of query: proposing a matching, the response to which is either that the proposed matching is stable, or a…
What does it mean for multiple agents' credence functions to be consistent with each other, if the agents have distinct but overlapping sets of evidence? Mathematical philosopher Michael Titelbaum's rule, called Generalized…
The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the…
Qualitative Choice Logic (QCL) and Conjunctive Choice Logic (CCL) are formalisms for preference handling, with especially QCL being well established in the field of AI. So far, analyses of these logics need to be done on a case-by-case…
A quota mechanism, such as a mandatory grading curve, links together multiple decisions. We analyze the performance of quota mechanisms when the number of linked decisions is finite and the designer has imperfect knowledge of the type…
Fairness problems in recommender systems often have a complexity in practice that is not adequately captured in simplified research formulations. A social choice formulation of the fairness problem, operating within a multi-agent…
McCullagh and Yang (2006) suggest a family of classification algorithms based on Cox processes. We further investigate the log Gaussian variant which has a number of appealing properties. Conditioned on the covariates, the distribution over…
Actionable recourse studies whether individuals can modify feasible features to overturn unfavorable outcomes produced by AI-assisted decision-support systems. However, many such systems operate in competitive settings, such as admission or…
Many dynamical phenomena display a cyclic behavior, in the sense that time can be partitioned into units within which distributional aspects of a process are homogeneous. In this paper, we introduce a class of models - called conjugate…
Learning governing equations from a family of data sets which share the same physical laws but differ in bifurcation parameters is challenging. This is due, in part, to the wide range of phenomena that could be represented in the data sets…
We study fairness in social choice settings under single-peaked preferences. Construction and characterization of social choice rules in the single-peaked domain has been extensively studied in prior works. In fact, in the single-peaked…