Consensus-Halving: Does It Ever Get Easier? (Q5890032): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3008554935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-D Tucker is PPA complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk-Ulam Theorem and Bisection of Necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair and efficient cake division with connected pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete and bounded envy-free cake cutting protocol for four agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Topological Generalization of a Theorem of Tverberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drei Sätze über die n-dimensionale euklidische Sphäre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Non-Monotone Markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing a Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing exact solutions of consensus halving and the Borsuk-Ulam theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two's company, three's a crowd: consensus-halving for a constant number of agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Solutions for Envy-Free Cake Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding PPA-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nash Equilibria and Other Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus halving is PPA-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of splitting necklaces and bisecting ham sandwiches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisection of Circle Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hairy Ball problem is PPAD-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sperner lemma complete for PPA / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Moment Problem in L 1 Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The classes PPA-\(k\): existence from arguments modulo \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Rank Two-Player Games are PPAD-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5836126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial necklace splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus-halving via theorems of Borsuk-Ulam and Tucker / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la division pragmatique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837940 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:36, 1 August 2024

scientific article; zbMATH DE number 7680597
Language Label Description Also known as
English
Consensus-Halving: Does It Ever Get Easier?
scientific article; zbMATH DE number 7680597

    Statements

    Consensus-Halving: Does It Ever Get Easier? (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    consensus-halving
    0 references
    fair division
    0 references
    TFNP
    0 references
    PPA
    0 references
    PPAD
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references