Related papers: k-flaw Preference Sets

This paper characterizes lexicographic preferences over alternatives that are identified by a finite number of attributes. Our characterization is based on two key concepts: a weaker notion of continuity called 'mild continuity' (strict…

We say a model is continuous in utilities (resp., preferences) if small perturbations of utility functions (resp., preferences) generate small changes in the model's outputs. While similar, these two questions are different. They are only…

The Random K-Satisfiability Problem, consisting in verifying the existence of an assignment of N Boolean variables that satisfy a set of M=alpha N random logical clauses containing K variables each, is studied using the replica symmetric…

Recall that $\alpha=(a_1,a_2,\ldots,a_n)\in[n]^n$ is a parking function if its nondecreasing rearrangement $\beta=(b_1,b_2,\ldots,b_n)$ satisfies $b_i\leq i$ for all $1\leq i\leq n$. In this article, we study parking functions based on…

In the standard planar $k$-center clustering problem, one is given a set $P$ of $n$ points in the plane, and the goal is to select $k$ center points, so as to minimize the maximum distance over points in $P$ to their nearest center. Here we…

Ranking data arises in a wide variety of application areas but remains difficult to model, learn from, and predict. Datasets often exhibit multimodality, intransitivity, or incomplete rankings---particularly when generated by humans---yet…

In consumer theory, ranking available objects by means of preference relations yields the most common description of individual choices. However, preference-based models assume that individuals: (1) give their preferences only between pairs…

We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…

We study the computational complexity of explaining preference data through Boolean attribute models (BAMs), motivated by extensive research involving attribute models and their promise in understanding preference structure and enabling…

One of the prominent open problems in combinatorics is the discrepancy of set systems where each element lies in at most $t$ sets. The Beck-Fiala conjecture suggests that the right bound is $O(\sqrt{t})$, but for three decades the only…

We present a preference learning framework for multiple criteria sorting. We consider sorting procedures applying an additive value model with diverse types of marginal value functions (including linear, piecewise-linear, splined, and…

We study learning of human preferences from a limited comparison feedback. This task is ubiquitous in machine learning. Its applications such as reinforcement learning from human feedback, have been transformational. We formulate this…

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…

In the Set Cover problem, we are given a set system with each set having a weight, and we want to find a collection of sets that cover the universe, whilst having low total weight. There are several approaches known (based on greedy…

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car $c_i$ prefers parking space $p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an index into an…

A nonbinary Ford sequence is a de Bruijn sequence generated by simple rules that determine the priorities of what symbols are to be tried first, given an initial word of size $n$ which is the order of the sequence being generated. This set…

User preference learning is generally a hard problem. Individual preferences are typically unknown even to users themselves, while the space of choices is infinite. Here we study user preference learning from information-theoretic…