At IIM Bangalore
Competition and Cooperation in Business Ecosystems (course outline) – PGP Elective
Synopsis: There are no permanent enemies or friends in business. “Business is cooperation when it comes to creating a pie and competition when it comes to dividing it up”. Businesses are part of complex ecosystems crossing a variety of industries and organisations in which they make interdependent strategic decisions to compete and cooperate. An ecosystem view of businesses is becoming more relevant today due to technological advancements. For example, a linear thinking supply chain is transitioning into a networked thinking “supply ecosystem”. Cooperating with competitors (called “co-opetition”) is receiving a great deal of attention these days due to the reason that it creates a win-win situation for all the stakeholders in a business ecosystem. Game theory, a tool for analysis of interactive decision-making, provides a systematic way to analyze competition and cooperation in strategic ecosystems. This course is about analysis of competition and cooperation using game theory.
Cooperative Game Theory and Applications (course outline) – FPM Elective
Synopsis: This is an introductory course on cooperative game theory for doctoral students. The course has an equal mix of theory and application. Students will find this course to be a comprehensive overview of basic concepts in cooperative games and a few related topics such as matching theory and core-selecting auctions. The course will also enable students to learn how to apply some of these concepts to model business problems, particularly the problems arising in operations management. To give a broader perspective the topics for application are selected from supply chain, queuing system, communication networks, spectrum auction and bankruptcy problem among others.
Optimization Models in Operations Management – FPM Core
Synopsis: This is an optimization course for doctoral students in the production and operations management area. In the course, we first study Nonlinear Programming, wherein a nonlinear objective function is optimized subject to nonlinear constraints. We next study Convexity and the properties of convex functions. For convex functions, all we have to do is to identify a local optimum and we are assured that it is a global optimum. We next study Dynamic Programming, a collection of mathematical tools used to analyze sequential decision processes. We see how Dynamic Programming is used to solve the shortest route problem, resource allocation problems, production control and network flow problems, etc.
At IIT Madras (during doctoral study)
Taught a module on cooperative game theory as a part of Introduction to game theory, an undergraduate course during Fall 2014 and Fall 2015 (module outline)
- Mathematical foundations for operations, Research level, Spring 2016
- Introduction to game theory, Undergraduate level, Fall 2014 & Fall 2015
- Macroeconomics, Graduate level, Spring 2014
- Microeconomics, Graduate level, Fall 2013