Minimizing Envy and Maximizing Happiness in Graphical House Allocation

Anubhav Dhar; Ashlesha Hota; Palash Dey; Sudeshna Kolay

Home/Archive/arXiv

arXiv · 2505.00296

Minimizing Envy and Maximizing Happiness in Graphical House Allocation

Anubhav Dhar·Ashlesha Hota·Palash Dey·Sudeshna Kolay

View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the house allocation problem in a setting where agents are connected by a graph representing friendships. In this model, two agents can only envy each other if they are neighbors (i.e., friends) in the graph. Each agent has a set of preferred (liked) houses and dislikes the rest. An agent $a$ is said to envy a friend $b$ if $a$ is not assigned any house she likes, while $b$ is allocated a house that $a$ likes. This framework is known as graphical house allocation. Within this framework, we investigate two central problems. The first problem is to compute a house allocation that minimizes the number of envious agents. Multiple such allocations may exist that achieve the same minimum level of envy. Among all allocations that minimize envy, the second problem aims to find one that maximizes the number of agents who receive one of their preferred houses. We present a detailed complexity-theoretic analysis of these problems. In particular, we show that both problems can be solved in polynomial time when each agent prefers at most one house. However, both become NP-hard even when agents are allowed to prefer at most two houses, thereby highlighting the tight boundary between tractability and intractability. Additionally, we design exact algorithms for both problems under certain structural conditions on the agent graph, such as when the graph is sparse, has a small balanced separator, or admits a small vertex cover. These algorithms are significantly faster than the naive brute-force approach.

Explore related subjects

cs.DS cs.CC

Keep this discovery

BibTeX RIS

Anubhav Dhar, Ashlesha Hota, Palash Dey, Sudeshna Kolay. 2025-05-01. Minimizing Envy and Maximizing Happiness in Graphical House Allocation. https://arxiv.org/abs/2505.00296

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

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗