Parameterized complexity of manipulating sequential allocation

DOI10.3233/FAIA200081MaRDI QIDQ4999209zbMATH OpenFDO

Authors Michele Flammini, Hugo Gilbert

Publication date 6 July 2021

Full work available at URL https://arxiv.org/abs/1909.08920

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Manipulating picking sequences
• scientific article; zbMATH DE number 6902543
• Equilibria in sequential allocation
• Allocation of indivisible items with individual preference graphs
• The complexity of online manipulation of sequential elections

Cited in

(1)

• Manipulating picking sequences

This page was built for publication: Parameterized complexity of manipulating sequential allocation

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