Consensus halving for sets of items

DOI10.1007/978-3-030-64946-3_27MaRDI QIDQ2692297zbMATH OpenOpenAlexFDO

Authors Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64946-3_27

zbMATH Keywords

resource allocationPPAD-hardnessconsensus halving

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)

Recommendations

• Consensus Halving for Sets of Items
• Hardness results for consensus-halving
• Consensus halving is PPA-complete
• Consensus-halving via theorems of Borsuk-Ulam and Tucker

Cited in

(5)

• A fixed-parameter algorithm for the Schrijver problem
• Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
• Consensus-Halving: Does It Ever Get Easier?
• The complexity of finding fair independent sets in cycles
• Two's company, three's a crowd: consensus-halving for a constant number of agents

This page was built for publication: Consensus halving for sets of items

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692297)