Related papers: Tight Guarantees in the Commons
Let $(X,\mathcal W)$ be a balayage space, $1\in \mathcal W$, or - equivalently - let $\mathcal W$ be the set of excessive functions of a Hunt process on a locally compact space $X$ with countable base such that $\mathcal W$ separates…
In this paper we give a general definition of weighted fairness and show how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 Specifications. We discuss how a pricing policy can be mapped to…
This work proposes a unified theory of regularity in one hypercomplex variable: the theory of $T$-regular functions. In the special case of quaternion-valued functions of one quaternionic variable, this unified theory comprises…
In this article our main object of investigation is the simple modular density ideals $\mathcal{Z}_g(f)$ introduced in [Bose et al., Indag. math., 2018] where $g$ is a weight function, more precisely, $g\in G$, $G=\{g:\omega \to…
We study the design of efficient mechanisms under asymmetric awareness and information. Unawareness refers to the lack of conception rather than the lack of information. Assuming quasi-linear utilities and private values, we show that we…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function…
The definition and implementation of fairness in automated decisions has been extensively studied by the research community. Yet, there hides fallacious reasoning, misleading assertions, and questionable practices at the foundations of the…
A major problem in fair division is how to allocate a set of indivisible resources among agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two well-studied measures of fairness and efficiency --…
We consider the fair division of indivisible items among $n$ agents with additive non-negative normalized valuations, with the goal of obtaining high value guarantees, that is, close to the proportional share for each agent. We prove that…
A new pair of asymptotic invariants for finitely presented groups, called intrinsic and extrinsic tame filling functions, are introduced. These filling functions are quasi-isometry invariants that strengthen the notions of intrinsic and…
We consider a model of power distribution in a social system where a set of agents play a simple game on a graph: the probability of winning each round is proportional to the agent's current power, and the winner gets more power as a…
Finite temperature density functional theory requires representations for the internal energy, entropy, and free energy as functionals of the local density field. A central formal difficulty for an orbital-free representation is…
This paper introduces a generalised opinion model that extends the standard DeGroot model by representing agents' opinions and influences as soft constraints rather than single real values. This allows for modelling scenarios beyond the…
We consider the problem of fair allocation of indivisible goods to agents with submodular valuation functions, where agents may have either equal entitlements or arbitrary (possibly unequal) entitlements. We focus on share-based fairness…
Let $(X,\mu)$ be a probability space equipped with an invertible, measure-preserving transformation $T\colon X \to X$. We exhibit a wide class of weights $w$ so that whenever $f,g \in L^{\infty}(X)$, the bilinear ergodic averages \[…
Conditional independence in a multivariate normal (or Gaussian) distribution is characterized by the vanishing of subdeterminants of the distribution's covariance matrix. Gaussian conditional independence models thus correspond to algebraic…
We study coverage problems in which, for a set of agents and a given threshold $T$, the goal is to select $T$ subsets (of the agents) that, while satisfying combinatorial constraints, achieve fair and efficient coverage among the agents. In…
A set function is called XOS if it can be represented by the maximum of additive functions. When such a representation is fixed, the number of additive functions required to define the XOS function is called the width. In this paper, we…
We analyze the run-time complexity of computing allocations that are both fair and maximize the utilitarian social welfare, defined as the sum of agents' utilities. We focus on two tractable fairness concepts: envy-freeness up to one item…