Saurabh Kumar
ABSTRACT
Allotting Teaching Assistants (TAs) to courses is a common task at university centers which typically demands a good amount of human effort. We propose a method to allocate using computer algorithm. The presence of conflicting constraints, posed by requirements which determine tradeoff among them tend to make this problem difficult to solve. This is essentially a matching problem and in this paper has been modeled as a Markov Chain of various intermediate allotments. Later we perform simple Monte-Carlo simulations over a naive bucket filling allotment. This leads us to a globally optimal allotment with a promise of faster convergence.
- D. Gale and L. S. Shapley, "College admissions and the stability of marriage," The American Mathematical Monthly, vol. 69, no. 1, pp. 9--15, 1962.Google Scholar
Cross Ref
- L. S. Shapley and M. Shubik, "The assignment game I: The core," International Journal of Game theory, vol. 1, no. 1, pp. 111--130, 1971.Google ScholarDigital Library
- A. S. Kelso Jr and V. P. Crawford, "Job matching, coalition formation, and gross substitutes," Econometrica: Journal of the Econometric Society, pp. 1483--1504, 1982.Google ScholarCross Ref
- A. E. Roth, "The evolution of the labor market for medical interns and residents: a case study in game theory," The Journal of Political Economy, pp. 991--1016, 1984.Google ScholarCross Ref
- C. Dodaro, N. Leone, B. Nardi, and F. Ricca, "Allotment problem in travel industry: A solution based on ASP," Web Reasoning and Rule Systems, pp. 77--92, 2015.Google ScholarCross Ref
- H. Mendelson, J. S. Pliskin, and U. Yechiali, "A stochastic allocation problem," Operations Research, vol. 28, no. 3, part-II, pp. 687--693, 1980.Google ScholarCross Ref
- E. Taillard, "Robust taboo search for the quadratic assignment problem," Parallel Computing, vol. 17, no. 4, pp. 443--455, 1991. Google ScholarDigital Library
- P. C. Chu and J. E. Beasley, "A genetic algorithm for the generalised assignment problem," Computers & Operations Research, vol. 24, no. 1, pp. 17--23, 1997. Google ScholarDigital Library
- A. Salman, I. Ahmad, and S. Al-Madani, "Particle swarm optimization for task assignment problem," Microprocessors and Microsystems, vol. 26, no. 8, pp. 363--371, 2002.Google ScholarCross Ref
- F. Bourgeois and J.-C. Lassalle, "An extension of the Munkres algorithm for the assignment problem to rectangular matrices," Communications of the ACM, vol. 14, no. 12, pp. 802--804, 1971. Google ScholarDigital Library
- J. Munkres, "Algorithms for the assignment and transportation problems," Journal of the Society for Industrial and Applied Mathematics, vol. 5, no. 1, pp. 32--38, 1957. {Online}. Available: http://www.jstor.org/stable/2098689Google ScholarCross Ref
- V. Guruswami, "Rapidly mixing Marko chains: A comparison of techniques," Available: http://cs.ashington.edu/homes/venkat/pubs/papers.html, 2000.Google Scholar
Recommendations
Computing resource allocation scheme based on edge computing under augmented reality application
Edge computing can place computing, storage, bandwidth, application and other resources on the edge of the network to reduce transmission delay, and bandwidth limitation for users. Therefore, task scheduling and resource allocation in edge computing ...
Accelerating MCMC algorithms
Markov chain Monte Carlo algorithms are used to simulate from complex statistical distributions by way of a local exploration of these distributions. This local feature avoids heavy requests on understanding the nature of the target, but it also ...
Markov chain Monte Carlo algorithms are used to simulate from complex statistical distributions by way of a local exploration of these distributions. This local feature avoids heavy requests on understanding the nature of target, but it also potentially ...
Sample selection for MCMC-based recommender systems
RecSys '13: Proceedings of the 7th ACM conference on Recommender systemsBayesian Inference with Markov Chain Monte Carlo (MCMC) has been shown to provide high prediction quality in recommender systems. The advantage over learning methods such as coordinate descent/alternating least-squares (ALS) or (stochastic) gradient ...
Comments