The following pages link to Assigning papers to referees (Q1959732):
Displaying 22 items.
- A statistical approach to calibrating the scores of biased reviewers of scientific papers (Q267651) (← links)
- Group-to-group reviewer assignment problem (Q502451) (← links)
- An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem (Q666946) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- Computational aspects of assigning agents to a line (Q1680103) (← links)
- Handling preferences in student-project allocation (Q1730741) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- Fair referee assignments for professional football leagues (Q2475851) (← links)
- Conference paper assignment (Q2762280) (← links)
- Finding a minimum-regret many-to-many Stable Matching (Q2868914) (← links)
- (Q5159440) (← links)
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
- The dynamics of rank-maximal and popular matchings (Q6093577) (← links)
- Online voluntary mentoring: optimising the assignment of students and mentors (Q6106994) (← links)
- On Fair Division under Heterogeneous Matroid Constraints (Q6135949) (← links)
- Computing fair and efficient allocations with few utility values (Q6159026) (← links)
