Related papers: Set systems related to a house allocation problem
The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power…
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…
Room allocation is a challenging task in detention centers since lots of related people need to be held separately with limited rooms. It is extremely difficult and risky to allocate rooms manually, especially for organized crime groups…
We study the classical problem of matching $n$ agents to $n$ objects, where the agents have ranked preferences over the objects. We focus on two popular desiderata from the matching literature: Pareto optimality and rank-maximality. Instead…
We consider the problem of allocating a set $I$ of $m$ indivisible resources (items) to a set $P$ of $n$ customers (players) competing for the resources. Each resource $j \in I$ has a same value $v_j > 0$ for a subset of customers…
A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…
The problem of how to allocate to states the seats in the US House of Representatives is the most studied instance of what is termed the `apportionment problem'. We propose a new method of apportionment which is stochastic, which meets the…
In solving Bayesian inverse problems, it is often desirable to use a common density parameterization to denote the prior and posterior. Typically we seek a density from the same family as the prior which closely approximates the true…
In this paper, we study the problem of evaluating the addition of elements to a set. This problem is difficult, because it can, in the general case, not be reduced to unconditional preferences between the choices. Therefore, we model…
In the past few decades, many multiobjective evolutionary optimization algorithms (MOEAs) have been proposed to find a finite set of approximate Pareto solutions for a given problem in a single run, each with its own structure. However, in…
Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational mechanism design. We investigate the role of randomized…
Via a family of monotone scalar functions, a preorder on a set is extended to its power set and then used to construct a hull operator and a corresponing complete lattice of sets. A function mappping into the preordered set is extended to a…
We study \emph{combinatorial procurement auctions}, where a buyer with a valuation function $v$ and budget $B$ wishes to buy a set of items. Each item $i$ has a cost $c_i$ and the buyer is interested in a set $S$ that maximizes $v(S)$…
A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…
We study the fair allocation of indivisible goods across groups of agents, where each agent fully enjoys all goods allocated to their group. We focus on groups of two (couples) and other groups of small size. For two couples, an EF1…
The problem of lifting a preference order on a set of objects to a preference order on a family of subsets of this set is a fundamental problem with a wide variety of applications in AI. The process is often guided by axioms postulating…
Recent advances in machine learning have spurred significant interest in learning-augmented algorithms, particularly for online optimization. A growing body of work has studied online bidding in this framework, aiming to characterize the…
We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum discrepancy of the label values within each of the sets is…
A family $\mathcal F\subset {[n]\choose k}$ is $U(s,q)$ of for any $F_1,\ldots, F_s\in \mathcal F$ we have $|F_1\cup\ldots\cup F_s|\le q$. This notion generalizes the property of a family to be $t$-intersecting and to have matching number…
We consider the max-min fair resource allocation problem. The best-known solutions use either a sequence of optimizations or waterfilling, which only applies to a narrow set of cases. These solutions have become a practical bottleneck in…