Computational Aspects of Cooperative Game Theory (Synthesis Lectures on Artificial Intelligence and Machine Learning
Computational Aspects of Cooperative Game Theory (Synthesis Lectures on Artificial Intelligence and Machine Learning
Paperback
Couldn't load pickup availability
Join our rewards scheme and earn 93 reward points on this purchase!
Earn 93 points on this!
Sign in or Sign up!- Release Date: 26/10/2011
- Barcode: 9783031004308
- Genre: Computing & Internet
- Sub-Genre: Science Nature & Math
- Imprint: Springer International
- Publisher: Springer

Computational Aspects of Cooperative Game Theory (Synthesis Lectures on Artificial Intelligence and Machine Learning
1st
Couldn't load pickup availability
Collapsible content
DESCRIPTION
We survey several formalisms for cooperative games that have been proposed in the literature, including, for example, cooperative games defined on networks, as well as general compact representation schemes such as MC-nets and skill games.
Cooperative game theory is a branch of (micro-)economics that studies the behavior of self-interested agents in strategic settings where binding agreements among agents are possible. Our aim in this book is to present a survey of work on the computational aspects of cooperative game theory. We begin by formally defining transferable utility games in characteristic function form, and introducing key solution concepts such as the core and the Shapley value. We then discuss two major issues that arise when considering such games from a computational perspective: identifying compact representations for games, and the closely related problem of efficiently computing solution concepts for games. We survey several formalisms for cooperative games that have been proposed in the literature, including, for example, cooperative games defined on networks, as well as general compact representation schemes such as MC-nets and skill games. As a detailed case study, we consider weighted voting games:a widely-used and practically important class of cooperative games that inherently have a natural compact representation. We investigate the complexity of solution concepts for such games, and generalizations of them. We briefly discuss games with non-transferable utility and partition function games. We then overview algorithms for identifying welfare-maximizing coalition structures and methods used by rational agents to form coalitions (even under uncertainty), including bargaining algorithms. We conclude by considering some developing topics, applications, and future research directions.
DELIVERY & RETURNS
UK Delivery:
- Free delivery on all orders of £10 or more.
- £1.49 delivery fee on orders below £10.
- UK orders are shipped via Royal Mail 2nd Class.
International Delivery:
- Flat rate delivery charges vary by country.
Dispatch and Delivery Times:
- All orders are shipped from our warehouse in Northampton, UK within 48 hours of receipt during working hours.
- UK mainland orders typically arrive within 3-5 working days via Royal Mail 2nd Class.
- International estimated delivery times:
- Europe & Channel Islands: 7 to 10 working days
- USA: 7 to 15 working days
- Rest of the World: 9 to 21 working days
View our full delivery infomation here.
-
OVER
2 MILLION PRODUCTS
-
60 MILLION CUSTOMERS
ACROSS 190 COUNTRIES
You might also like
Loading recommendations...