• Corpus ID: 246210171

Fixed-point cycles and EFX allocations

  title={Fixed-point cycles and EFX allocations},
  author={Benjamin Aram Berendsohn and Simona Boyadzhiyska and L{\'a}szl{\'o} Kozma},
We study edge-labelings of the complete bidirected graph ↔ Kn with functions from the set [d] = {1, . . . , d} to itself. We call a cycle in ↔ Kn a fixed-point cycle if composing the labels of its edges results in a map that has a fixed point, and we say that a labeling is fixed-point-free if no fixed-point cycle exists. For a given d, we ask for the largest value of n, denoted Rf (d), for which there exists a fixed-point-free labeling of ↔ Kn. Determining Rf (d) for all d > 0 is a natural… 
2 Citations

Figures from this paper

EFX Allocations: Simplifications and Improvements
The existence of EFX allocations is a fundamental open problem in discrete fair division. Given a set of agents and indivisible goods, the goal is to determine the existence of an allocation where no
Fair allocation of a multiset of indivisible items
We study the problem of fairly allocating a multiset M of m indivisible items among n agents with additive valuations. Specifically, we introduce a parameter t for the number of distinct types of


On three zero-sum Ramsey-type problems
It is proved that for every integer k1R(Kn, Zk) ≤ n + O(k3 log k) provided n is sufficiently large as a function of k and k divides ().
Improving EFX Guarantees through Rainbow Cycle Number
This paper studies the problem of fairly allocating a set of indivisible goods among n agents with additive valuations and shows the existence of 0.618-EFX allocations and that EFX allocation exists if the authors do not allocate at most n - 1 goods.
Cycles of length 0 modulo k in directed graphs
Divisible subdivisions
It is proved that for every graph H there is a finite f=f(H,q) such that every edge of H contains a subdivision of H in which every edge is replaced by a path whose length is divisible by q.
Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items
It is shown that for every instance with additive valuations, there is an EFX allocation of a subset of items with a Nash welfare that is at least half of the maximum possible Nash welfare for the original set of items.
Zero-sum problems - A survey
  • Y. Caro
  • Mathematics
    Discret. Math.
  • 1996
Theorem in the Additive Number Theory
THEOREM. Each set of 2n-1 integers contains some subset of n elements the sum of which is a multiple of n. PROOF. Assume first n = p (p prime). Our theorem is trivial for p = 2, thus henceforth p >
Zero-sum sets of prescribed size
Erdős, Ginzburg and Ziv proved that any sequence of 2n−1 integers contains a subsequence of cardinality n the sum of whose elements is divisible by n. We present several proofs of this result,
Zero Sum Trees: A Survey of Results and Open Problems
This is an expository paper which surveys results related to the recent confirmation of the zero-sum-tree conjecture by Z. Furedi and D. Kleitman. The author believes that trees play a major role in