Fairness in temporal slot assignment
From MaRDI portal
Publication:6109542
DOI10.1007/978-3-031-15714-1_28zbMath1520.91204OpenAlexW4297821613MaRDI QIDQ6109542
Edith Elkind, Nicholas J. Teh, Sonja Kraiczy
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
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Welfare economics (91B15) Algorithmic game theory and complexity (91A68)
Cites Work
- Unnamed Item
- Unnamed Item
- On covering problems of codes
- Interpolating polynomials from their values
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Distinguishing string selection problems.
- On a conjecture of Stein
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Polynomial interpolation in several variables
- On maximum weighted Nash welfare for binary valuations
- Rainbow Matchings: existence and counting
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Handbook of Computational Social Choice
- The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
This page was built for publication: Fairness in temporal slot assignment
