Ajay Srinivasan Aravamudhan

Education

• Master of Science in Operations Management
• Singapore Mangement University, Singapore (2009 - 2011)
• Advisor: Prof. Pascale Crama
• Master of Computer Applications
• Anna University, Chennai (1999 - 2002)
• Bachelor of Science
• Sri Venkateswara University (1996 - 1999)
• Majored in Mathematics, Physics, Chemistry

Work Experience

• Research Engineer, LARC @ SMU (2011 to present)
• Software Engineer, Samsung Electronics (2005 to 2009)
• Software Engineer, SCM Microsystems (2002 to 2004)

Download CV (pdf, 124KB), in picture form, courtesy here

• Ajay S.A.
  Research Engineer
  Living Analytics Research Center (LARC)
  School of Information Systems
  80 Stamford Road
  Singapore - 178902
• EMail:ajaysa /at/ smu.edu.sg
• Phone: (+65) 9076 4167

Lagrangian Relaxation for Large-Scale Multi-Agent Planning

• Extended Abstract(pdf, 184 KB), AAMAS 2012 (accepted)

Authors:Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S Aravamudhan, Shih Fen Cheng

Abstract:We focus on provably near-optimal solutions for domains with large number of agents, by exploiting a common property: if individual agents each have a limited influence on the quality of the overall solution, we can take advantage of randomization and the resulting statistical concentration to show that each agent can safely plan based only on the average behavior of the other agents.

(Research Assistant to Prof. Pradeep Varakantham, Prof. HC Lau and Dr. William Yeoh)

Advertising Revenue Optimization in Live Television Broadcasting

• Paper submitted to Management Science (Jan 2012)
• Authors:Pascale Crama , Dana Popescu, Ajay S Aravamudhan
• Full Paper(pdf, 300 KB)

Optimal Advertisement Scheduling in Breaks of Random Lengths

• Master's thesis, defended in July 2011
• Abstract:We study ad scheduling policies in live broadcasting when breaks are of non-deterministic lengths and number. We characterize the optimal dynamic schedule in a simple setting with two ad lengths, and also present heuristics to solve the full size scheduling problem.
• Thesis(pdf, 380KB), slides(pdf, 371KB)

Documents and presentations (pdf)

1. CV
2. Master's Thesis , and Thesis defence slides
3. Dantzig Wolfe Decomposition (for people with some knowledge of LP)
4. Thoughts on Adaptive Submodularity of Advertisement Scheduling
5. Full Paper of Advertising Revenue Optimization in Live Television Broadcasting, submitted to Management Science
6. A math model for the Orienteering problem in theme parks