My present research is focused on developing efficient and near optimal algorithms for combinatorial problems, especially those that arise in the context of scheduling, resource allocation and network games. My research advisor is Andreas S. Schulz. Before this, I have dabbled in several topics in my undergraduate study, which include game theory, mechanism design, logic, natural language processing and computational linguistics. Papers Recent Papers Shashi Mittal and Andreas S. Schulz (2008) ``A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One''. In Proceedings of 11th International Workshop on Approximation and Randomized Algorithms (RANDOM-APPROX 2008).[PDF][Slides] Shashi Mittal and Kalyanmoy Deb (2006) ``Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives''. In IEEE Transactions on Evolutionary Computation. [Link][PDF - Conference version] Working Papers Shashi Mittal and Andreas S. Schulz ``A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One''. Journal version, in preparation. Shashi Mittal and Andreas S. Schulz ``An FPTAS for Optimizing a Class of Low-Rank Functions Over a Polytope''. To be submitted. Shashi Mittal and Andreas S. Schulz ``The Page Sharing Problem''. In preparation. Theses Nitesh Kumar and Shashi Mittal (2006) ``Efficient algorithms for solving stochastic games on finite graphs''. Senior year thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India. [PDF] Advisor: Prof. Anil Seth Some older reports can be found here.