A Recursive Value for n -Person Cooperative Games
Some solution concepts for n -person games admit a recursive definition. In such a recursion, the solution of an n -person game is computed by using the knowledge of how some of the proper subgames of a given game have been solved. While these kind of recursion formulas are of course computational devices, they can also help us to understand the bargaining processes behind various solution concepts. Two recursion formulas leading to the Shapley value are studied in more detail.
When requesting a correction, please mention this item's handle: RePEc:utu:wpaper:116. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Jouni Jokinen)
If references are entirely missing, you can add them using this form.