English
Related papers

Related papers: Continuity Assumptions in Cake-Cutting

200 papers

In this paper we consider nonmeasurablity with respect to sigma-ideals defined be trees. First classical example of such ideal is Marczewski ideal s_0. We will consider also ideal l_0 defined by Laver trees and m_0 defined by Miller trees.…

General Topology · Mathematics 2015-07-10 Robert Ralowski , Szymon Zeberski

A review of the state of the art of the comparison between any two different modes of convergence of sequences of measurable functions is carried out with focus on the algebraic structure of the families under analysis. As a complement of…

Functional Analysis · Mathematics 2026-04-10 L. Bernal-González , M. C. Calderón-Moreno , P. J. Gerlach-Mena , J. A. Prado-Bassas

A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…

Probability · Mathematics 2011-09-22 Graham Brightwell , Malwina Luczak

In the classic problem of fair cake-cutting, a single interval ("cake") has to be divided among n agents with different value measures, giving each agent a single sub-interval with a value of at least 1/n of the total. This paper studies a…

Combinatorics · Mathematics 2020-06-19 Erel Segal-Halevi

We study the problem of fairly allocating a divisible resource in the form of a graph, also known as graphical cake cutting. Unlike for the canonical interval cake, a connected envy-free allocation is not guaranteed to exist for a graphical…

Computer Science and Game Theory · Computer Science 2024-06-18 Sheung Man Yuen , Warut Suksompong

We show that the set of Lebesgue integrable functions in $[0,1]$ which are nowhere essentially bounded is spaceable, improving a result from [F. J. Garc\'{i}a-Pacheco, M. Mart\'{i}n, and J. B. Seoane-Sep\'ulveda. \textit{Lineability,…

Functional Analysis · Mathematics 2012-05-01 Szymon Glab , Pedro L. Kaufmann , Leonardo Pellegrini

A generalization of the classical Sard theorem in the plane is the following. Let $f$ be a function defined on a subset $A\subset{\mathbb R}^2$. If $f$ has modulus of continuity $\omega(r)\lesssim r^2$, then $f(A)\subset{\mathbb R}$ has…

Classical Analysis and ODEs · Mathematics 2025-04-10 Iqra Altaf , Marianna Csörnyei

The paper is devoted to the study of extremal points of $\mathcal{C}$, the family of all two-variate coherent distributions on $[0,1]^2$. It is well-known that the set $\mathcal{C}$ is convex and weak$^*$ compact, and all extreme points of…

Probability · Mathematics 2023-11-15 Stanisław Cichomski , Adam Osękowski

In this article we treat two closely related problems: 1) the upper semi continuity property for Almgren minimal sets in regions with regular boundary, which guanrantees that the uniqueness property is well defined; and 2) the Almgren…

Classical Analysis and ODEs · Mathematics 2018-08-30 Xiangyu Liang

Suppose $E, F$ are Borel sets in the plane, $\dim_{\mathcal{H}} E>1$, $\dim_{\mathcal{H}} E+\dim_{\mathcal{H}} F>2$, and $F$ has equal Hausdorff and packing dimension. We prove that there exists $y\in F$ such that the pinned distance set…

Classical Analysis and ODEs · Mathematics 2026-04-28 Bochen Liu

One can describe isomorphism of two compact hyperbolic Riemann surfaces of the same genus by a measure-theoretic property: a chosen isomorphism of their fundamental groups corresponds to a homeomorphism on the boundary of the Poincar\'e…

Algebraic Geometry · Mathematics 2011-12-22 Gunther Cornelissen , Janne Kool

We introduce a graphical framework for fair division in cake cutting, where comparisons between agents are limited by an underlying network structure. We generalize the classical fairness notions of envy-freeness and proportionality to this…

Data Structures and Algorithms · Computer Science 2017-07-10 Xiaohui Bei , Youming Qiao , Shengyu Zhang

We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum…

Logic · Mathematics 2016-04-06 Saeed Ghasemi

This is a paper that aims to interpret the cardinality of a set in terms of Baire Category, i.e. how many closed nowhere dense sets can be deleted from a set before the set itself becomes negligible. . To do this natural tree-theoretic…

Logic · Mathematics 2020-01-14 Andrew Powell

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

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…

Computer Science and Game Theory · Computer Science 2012-04-10 Egor Ianovski

We formulate and prove a dimension-theoretic generalization of the Lebesgue Covering Theorem. A generalized $n$-dimensional version of the Steinhaus Chessboard Theorem, recently proved by Turza\'nski and Ziajor, is a simple consequence of…

Classical Analysis and ODEs · Mathematics 2026-02-17 Michał Dybowski

The Riesz-Markov theorem identifies any positive, finite, and regular Borel measure on the complex unit circle with a positive linear functional on the continuous functions. By the Weierstrass approximation theorem, the continuous functions…

Functional Analysis · Mathematics 2019-10-23 Michael T. Jury , Robert T. W. Martin

We provide an algorithm to approximate a finitely supported discrete measure $\mu$ by a measure $\nu_{N}$ corresponding to a set of $N$ points so that the total variation between $\mu$ and $\nu_N$ has an upper bound. As a consequence if…

Number Theory · Mathematics 2022-07-11 Samantha Fairchild , Max Goering , Christian Weiß

A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…

Logic · Mathematics 2018-11-05 Chitat Chong , Wei Li , Wei Wang , Yue Yang
‹ Prev 1 4 5 6 7 8 10 Next ›