Fairness in temporal slot assignment

DOI10.1007/978-3-031-15714-1_28MaRDI QIDQ6109542zbMATH OpenOpenAlexFDO

Authors Edith Elkind, Sonja Kraiczy, Nicholas J. Teh

Publication date 28 July 2023

Published in Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15714-1_28

Mathematics Subject Classification ID

Algorithmic game theory and complexity (91A68) Welfare economics (91B15) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Fair assignment of indivisible objects under ordinal preferences
• Size versus fairness in the assignment problem
• A solution to the random assignment problem on the full preference domain
• A graph theoretic approach to the slot allocation problem
• Assigning agents to a line

Cites work

• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Distinguishing string selection problems.
• Fair Allocation of Indivisible Goods to Asymmetric Agents
• Handbook of Computational Social Choice
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Interpolating polynomials from their values
• On a conjecture of Stein
• On covering problems of codes
• On maximum weighted Nash welfare for binary valuations
• Polynomial interpolation in several variables
• Rainbow matchings: existence and counting
• The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
• Triangular Factorization and Inversion by Fast Matrix Multiplication

Cited in

(2)

• Fairly taking turns
• Fair integer programming under dichotomous and cardinal preferences

This page was built for publication: Fairness in temporal slot assignment

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