Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.05638

Three-dimensional Stable Matching with Cyclic Preferences

Kanstantsin Pashkovich·Laurent Poirrier
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the three-dimensional stable matching problem with cyclic preferences, a problem originally proposed by Knuth. Despite extensive study of the problem by experts from different areas, the question of whether every instance of this problem admits a stable matching remains unanswered. In 2004, Boros, Gurvich, Jaslar and Krasner showed that a stable matching always exists when the number of agents in each of the groups is three. In 2006, Eriksson, Sjöstrand and Strimling showed that a stable matching exists also when the number of agents in each group is four. In this paper, we demonstrate that a stable matching exists when each group has five agents. Furthermore, we show that there are at least two distinct stable matchings in that setting.

Explore related subjects

cs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kanstantsin Pashkovich, Laurent Poirrier. 2018-09-29. Three-dimensional Stable Matching with Cyclic Preferences. https://arxiv.org/abs/1807.05638

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Switchback Price Experiments with Forward-Looking Demand

Switchback experiments are widely used in pricing applications. We consider a retailer running such an experiment for the price of a single product, with infinite supply. In each period, the seller chooses a price from a set of predefined prices consisting of an original price and a few discounted price levels. The goal is to estimate the demand gradient at the original price to adjust the original price and improve revenue after the experiment. In our model, in each period, a unit mass of buyers arrives on the market, with values distributed based on a time-varying process. Crucially, buyers are forward-looking with a discounted utility and will choose not to purchase now if they expect to face a discounted price in the near future. We show that such forward-looking behavior introduces bias in naive estimators of the demand gradient, due to intertemporal interference. Furthermore, although experiments with only two price points are common in practice, we prove that no estimator using data from such experiments can recover the correct demand gradient, even in the limit of an infinitely long experiment with an infinitesimal price discount. Moreover, we characterize the form of the bias of naive estimators. Finally, we show that with a simple three-price-level experiment, the seller can remove the bias due to strategic forward-looking behavior and construct an estimator for the demand gradient that asymptotically recovers the truth. Our results provide practical guidance for platforms to obtain unbiased demand gradients from price experiments in the presence of forward-looking demand.

cs.GT↗
arXiv2026

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT↗
arXiv2026

Infinite lexicographic products of positional objectives

This paper contributes to the study of positional determinacy of infinite duration games played on potentially infinite graphs with neutral transitions. Recently, [Ohlmann, TheoretiCS 2023] established that positionality of prefix-independent objectives is preserved by finite lexicographic products. We propose two different notions of infinite lexicographic products indexed by arbitrary ordinals, and extend Ohlmann's result by proving that they also preserve positionality. In the context of one-player positionality, this extends positional determinacy results of [Grädel and Walukiewicz, Logical Methods in Computer Science 2006] to edge-labelled games and arbitrarily many priorities for both Max-Parity and Min-Parity. Moreover, we show that the Max-Parity objectives over countable ordinals are complete for the infinite levels of the difference hierarchy over $Σ^0_2$ and that Min-Parity is complete for the class $Σ^0_3$. We obtain therefore positional languages that are complete for all those levels, as well as new insights about closure under unions and neutral letters.

cs.GT↗