On seat allocation problem with multiple merit lists

08/13/2020
by   Rahul Kumar Singh, et al.
0

In this note, we present a simpler algorithm for joint seat allocation problem in case there are two or more merit lists. In case of two lists (the current situation for Engineering seats in India), the running time of the algorithm is proportional to sum of running time for two separate (delinked) allocations. The algorithm is straight forward and natural and is not (at least directly) based on deferred acceptance algorithm of Gale and Shapley. Each person can only move higher in his or her preference list. Thus, all steps of the algorithm can be made public. This will improve transparency and trust in the system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2018

On testing substitutability

The papers hatfimmokomi11 and azizbrilharr13 propose algorithms for test...
research
04/14/2019

Joint Seat Allocation 2018: An algorithmic perspective

Until 2014, admissions to the Indian Institutes of Technology (IITs) wer...
research
06/17/2020

Improvements in Computation and Usage of Joint CDFs for the N-Dimensional Order Statistic

Order statistics provide an intuition for combining multiple lists of sc...
research
08/19/2022

Merging Sorted Lists of Similar Strings

Merging T sorted, non-redundant lists containing M elements into a singl...
research
01/13/2023

Quick Minimization of Tardy Processing Time on a Single Machine

We consider the problem of minimizing the total processing time of tardy...
research
11/27/2019

Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler

The algorithm and complexity of approximating the permanent of a matrix ...
research
12/06/2018

ALLSAT compressed with wildcards: Partitionings and face-numbers of simplicial complexes

Given the facets of a finite simplicial complex, we use wildcards to enu...

Please sign up or login with your details

Forgot password? Click here to reset