Related papers: Thinned Quantile Shares are Universally Feasible
We consider the problem of fairly allocating indivisible public goods. We model the public goods as elements with feasibility constraints on what subsets of elements can be chosen, and assume that agents have additive utilities across…
Hartle and Srednicki have suggested that standard quantum theory does not favor our typicality. Here an alternative version is proposed in which typicality is likely, Eventual Quantum Mechanics. This version allows one to calculate…
We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs). This formulation provides a direct interpretation of density matrices as quasi-moment matrices. Using…
Quantum networks are essential for advancing scalable quantum information processing. Quantum nonlocality sharing provides a crucial strategy for the resource-efficient recycling of quantum correlations, offering a promising pathway toward…
It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation precisely and it was suggested to use probabilistic gate arrays…
One of quantum theory's salient features is its apparent indeterminism, i.e. measurement outcomes are typically probabilistic. We formally define and address whether this uncertainty is unavoidable or whether post-quantum theories can offer…
We study quasi-Monte Carlo (QMC) integration over the multi-dimensional unit cube in several weighted function spaces with different smoothness classes. We consider approximating the integral of a function by the median of several integral…
We give a cohomological criterion for a parabolic vector bundle on a curve to be semistable. It says that a parabolic vector bundle $E$ with rational parabolic weights is semistable if and only if there is another parabolic vector bundle…
A graph $G$ is equitably $k$-choosable if, for every $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\left\lceil |V(G)|/k\right\rceil$ vertices. Equitable list-coloring was introduced by Kostochka,…
Building on previous papers by Anantharaman-Delaroche (AD) we introduce and study the notion of AD-amenability for partial actions and Fell bundles over discrete groups. We prove that the cross-sectional C*-algebra of a Fell bundle is…
Consider a smooth quasiprojective variety X equipped with a C*-action, and a regular function f: X -> C which is C*-equivariant with respect to a positive weight action on the base. We prove the purity of the mixed Hodge structure and the…
We study the fundamental problem of fairly allocating a set of indivisible goods among $n$ agents with additive valuations using the desirable fairness notion of maximin share (MMS). MMS is the most popular share-based notion, in which an…
The present paper describes a practical example in which the probability distribution of the prices of a stock market blue chip is calculated as the wave function of a quantum particle confined in a potential well. This model may naturally…
We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WMMS fairness and OWMMS fairness. We first highlight the fact…
Given a partition $\{I_1,\ldots,I_k\}$ of $\{1,\ldots,n\}$, let $(X_1,\ldots,X_n)$ be random vector with each $X_i$ taking values in an arbitrary measurable space $(S,\mathscr{S})$ such that their joint law is invariant under finite…
Quantile regression is a tool for learning conditional distributions. In this paper we study quantile regression in the setting where a protected attribute is unavailable when fitting the model. This can lead to "unfair'' quantile…
We consider the problem of allocating indivisible goods fairly among n agents who have additive and submodular valuations for the goods. Our fairness guarantees are in terms of the maximin share, that is defined to be the maximum value that…
This work addresses fair allocation of indivisible items in settings wherein it is feasible to create copies of resources or dispose of tasks. We establish that exact maximin share (MMS) fairness can be achieved via limited duplication of…
The accessible information acc(E) of an ensemble E is the maximum mutual information between a random variable encoded into quantum states, and the probabilistic outcome of a quantum measurement of the encoding. Accessible information is…
The Universal Composability model (UC) by Canetti (FOCS 2001) allows for secure composition of arbitrary protocols. We present a quantum version of the UC model which enjoys the same compositionality guarantees. We prove that in this model…