Computational Aspects of Cooperative Game Theory (Record no. 84591)

000 -LEADER
fixed length control field 03954nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-031-01558-8
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730163426.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2012 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031015588
-- 978-3-031-01558-8
082 04 - CLASSIFICATION NUMBER
Call Number 006.3
100 1# - AUTHOR NAME
Author Chalkiadakis, Georgios.
245 10 - TITLE STATEMENT
Title Computational Aspects of Cooperative Game Theory
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2012.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XVI, 150 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Artificial Intelligence and Machine Learning,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Introduction -- Basic Concepts -- Representations and Algorithms -- Weighted Voting Games -- Beyond Characteristic Function Games -- Coalition Structure Formation -- Advanced Topics.
520 ## - SUMMARY, ETC.
Summary, etc 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.
700 1# - AUTHOR 2
Author 2 Elkind, Edith.
700 1# - AUTHOR 2
Author 2 Wooldridge, Michael.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-01558-8
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2012.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Machine learning.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Neural networks (Computer science) .
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial Intelligence.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Machine Learning.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematical Models of Cognitive Processes and Neural Networks.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 1939-4616
912 ## -
-- ZDB-2-SXSC

No items available.