Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information

Chandrashekar, TS and Narahari, Yadati (2005) Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information. [Book Chapter]

PDF fulltext.pdf - Published Version Restricted to Registered users only Download (368kB) | Request a copy

Abstract

In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified source node s to a specified target node t in a directed acyclic network. The budget may reflect the level of utility that he associates in going from node s to node t. The edges in the network are owned by individual utility maximizing agents each of whom incurs some cost in allowing its use. We investigate the design of economic mechanisms to obtain a least cost path from s to t and to share the surplus (difference between the budget and the cost of the shortest path) generated among the participating agents in a fair manner. Previous work related to this problem assumes that cost and budget information is common knowledge. This assumption can be severely restrictive in many common applications. We relax this assumption and allow both budget and cost information to be private, hence known only to the respective agents. We first develop the structure of the shortest path cooperative game with incomplete information. We then show the non-emptiness of the incentive compatible core of this game and the existence of a surplus sharing mechanism that is incentive efficient and individually rational in virtual utilities, and strongly budget balanced.

Item Type:	Book Chapter
Series.:	Lecture Notes in Computer Science
Publisher:	Springer
Additional Information:	Copyright of this article belongs to Springer.
Keywords:	Core.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	02 Jun 2009 05:15
Last Modified:	19 Sep 2010 04:54
URI:	http://eprints.iisc.ac.in/id/eprint/16945

Actions (login required)

View Item