Related papers: Cutting Cakes Correctly
We examine the history of cake cutting mechanisms and discuss the efficiency of their allocations. In the case of piecewise uniform preferences, we define a game that in the presence of strategic agents has equilibria that are not dominated…
Consider n straight line cuts of a circular pizza made so as to maximize the number of pieces. We investigate how fair such a maximal division may be and how many slices are obtained if the cuts are successfully made with a certain…
The inequality of Clauser and Horne [ Phys. Rev. D 10, 526 (1974)], intended to overcome the limited scope of other inequalities to deterministic theories, is shown to have a resticted validity even in case of perfect detectors and perfect…
This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements originating from the division of land estates: (1) each…
This paper has been withdraw by the auhor due to a mistake in classification of the algebra
We correct a partial mistake for a metric presented in the article "Lattice constellation and codes from quadratic number fields" [IEEE Trans. Inform. Theory, vol. 47, No. 4, May. 2001]. We show that the metric defined in the article is not…
The Foulkes conjecture states that the multiplicities in the plethysm Sym^a(Sym^b V) are at most as large as the multiplicities in the plethysm Sym^b(Sym^a V) for all a <= b. This conjecture has been known to be true for a <= 4. The main…
It is stated by C. Simon, quant-ph/0410032, that the definition of "classicality" used in quant-ph/0310116 is "much narrower than Bell's concept of local hidden variables" and that, in the separable quantum case, the validity of the perfect…
This paper extends the classic cake-cutting problem to a situation in which the "cake" is divided among families. Each piece of cake is owned and used simultaneously by all members of the family. A typical example of such a cake is land. We…
Recently some papers, such as Aban, Meerschaert and Panorska (2006), Nuyts (2010) and Clark (2013), have drawn attention to possible truncation in Pareto tail modelling. Sometimes natural upper bounds exist that truncate the probability…
This paper has been withdrawn by the author since the proof of Lemma 8 is not correct.
A tangle is a connected topological space constructed by gluing several copies of the unit interval $[0, 1]$. We explore which tangles guarantee envy-free allocations of connected shares for n agents, meaning that such allocations exist no…
We revisit the classic problem of fair division from a mechanism design perspective, using {\em Proportional Fairness} as a benchmark. In particular, we aim to allocate a collection of divisible items to a set of agents while incentivizing…
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
This article is intended as a compendium and guide to the variety of Bell Inequality derivations that have appeared in the literature in recent years, classifying them into six broad categories, revealing the underlying, often hidden,…
The 2023 paper ``On Team Decision Problems With Nonclassical Information Structures'' [1] presented information states and dynamic programming (DP) equations for delayed sharing information patterns, based on the concept of person-by-person…
Across machine learning (ML) sub-disciplines, researchers make explicit mathematical assumptions in order to facilitate proof-writing. We note that, specifically in the area of fairness-accuracy trade-off optimization scholarship, similar…
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…
It is commonly believed that, in a real-world environment, samples can only be drawn from observational and interventional distributions, corresponding to Layers 1 and 2 of the Pearl Causal Hierarchy. Layer 3, representing counterfactual…
Cake-cutting protocols aim at dividing a ``cake'' (i.e., a divisible resource) and assigning the resulting portions to several players in a way that each of the players feels to have received a ``fair'' amount of the cake. An important…