Design of Incentive Compatible Mechanisms for Stackelberg Problems.pdfVIP

Design of Incentive Compatible Mechanisms for Stackelberg Problems Dinesh Garg1 and Y. Narahari 2 1 Department of Computer Science and Automation, Indian Institute of Science, Bangalore - 560 012, India. Email: dgarg@csa.iisc.ernet.in 2 Department of Computer Science and Automation, Indian Institute of Science, Bangalore - 560 012, India. Email: hari@csa.iisc.ernet.in. Tel.: +91-80 Abstract. This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems in- volving selfish agents. We call these Stackelberg problems. These are problems where the decisions or actions in successive layers of the hi- erarchy are taken in a sequential way while decisions or actions within each layer are taken in a simultaneous manner. There are many im- mediate applications of these problems in distributed computing, grid computing, network routing, ad hoc networks, electronic commerce, and distributed artificial intelligence. We consider a special class of Stack- elberg problems called SLRF (Single Leader Rest Followers) problems and investigate the design of incentive compatible mechanisms for these problems. In developing our approach, we are guided by the classical theory of mechanism design. To illustrate the design of incentive com- patible mechanisms for Stackelberg problems, we consider first-price and second-price electronic procurement auctions with reserve prices. Using the proposed framework, we derive some interesting results regarding incentive compatibility of these two mechanisms. 1 Mechanism Design and Stackelberg Problems The Theory of M