Assigning papers to referees

DOI10.1007/s00453-009-9386-0zbMath1203.90092OpenAlexW1984187188MaRDI QIDQ1959732

Telikepalli Kavitha, Julián Mestre, Amit Kumar, Kurt Mehlhorn, Naveen Garg

Publication date: 7 October 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9386-0

zbMATH Keywords

fair assignmentLeximin principlerank-maximal matchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Related Items (17)

Simplified group activity selection with group size constraints ⋮ Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms ⋮ Computational aspects of assigning agents to a line ⋮ The dynamics of rank-maximal and popular matchings ⋮ Online voluntary mentoring: optimising the assignment of students and mentors ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Fair assignment of indivisible objects under ordinal preferences ⋮ Unnamed Item ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Handling preferences in student-project allocation ⋮ Distributed backup placement in networks ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases ⋮ Complexity of finding Pareto-efficient allocations of highest welfare ⋮ Computing fair and efficient allocations with few utility values ⋮ College admissions with ties and common quotas: integer programming approach ⋮ Unnamed Item ⋮ Finding a minimum-regret many-to-many Stable Matching

Uses Software

• Websubrev
• HotCRP
• Easychair

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• A solution to the random assignment problem on the full preference domain
• Another look at the degree constrained subgraph problem
• An approximation algorithm for the generalized assignment problem
• On a conjecture by Gale about one-sided matching problems
• Strategy-proof allocation of indivisible goods
• Minimum cycle bases
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Random Matching Under Dichotomous Preferences
• A new solution to the random assignment problem.

This page was built for publication: Assigning papers to referees