Y. Narahari, Dinesh Garg, Ramasuri Narayanam, and Hastagiri Prakash. Game Theoretic Problems in Network Economics and Mechanism Design Solutions. Springer Monograph Series in Advanced Information and Knowledge Processing Series, April 2009.

With the advent of the Internet and other modern information and communication technologies, a magnificent opportunity has opened up for introducing new, innovative models of commerce, markets, and business. Creating these innovations calls for significant interdisciplinary interaction among researchers in computer science, communication networks, operations research, economics, mathematics, sociology, and management science. In the emerging era of new problems and challenges, one particular tool that has found widespread applications is mechanism design. The focus of this monograph is to explore game theoretic modeling and mechanism design for problem solving in Internet and network economics. The monograph embodies the research carried out at the Electronic Commerce Laboratory and is perhaps the first of its genre, addressing the application of game theory and mechanism design to contemporary problems in electronic commerce and network economics problems. The monograph first provides a sound foundation of relevant concepts and theory, to help apply mechanism design to problem solving in a rigorous way. Three applications are explored in detail: (a) optimal sponsored web search auctions (b) resource allocation in computational grids with selfish agents (c) robust protocol design in wireless ad hoc networks.

Y. Narahari. Data Structures and Algorithms. Lecture Notes, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 2000.

• Download pdf file 
• View Web Lecture Notes

This is not a textbook on the subject, though it does have some ingredients like examples, problems, proofs, programming assignments, etc. This "lecture notes" offers an adequate exposure to important data structures and algorithms, with the level of contents lying somewhere between an undergraduate course in Data Structures and a first course in Algorithms. I have taught these topics to M.E. students with a non-CS background, I believe the "lecture notes" is at that level and would be accessible to second year or third year B.E./B. Tech students of Computer Science and for second year M.C.A. students. It should be useful to working software professionals and serious programmers striving to gain a sound understanding of commonly used data structures and algorithm design techniques. Familiarity with C programming is assumed from all readers.

N. Viswanadham and Y. Narahari. Performance Modeling of Automated Manufacturing Systems. Prentice Hall, Englewood Cliffs, NJ, USA, 1992.

• Reprinted by Prentice Hall of India, 1994, 1998, and 2005 
• Reprinted by Prentice Hall of Canada, 1997

The book, first published in 1992, resulted in unifying and clarifying the correct use of modeling methods based on Markov chains, queueing networks, and stochastic Petri nets for manufacturing systems. It is followed as a textbook or reference book at many universities all over the world and has gathered a fair number of citations over the years. The book has been reprinted thrice in India and once in Canada.