Isbn: 9783031004308 - computational aspects of cooperative game theory (synthesis lectures on artificial intelligence and machine learning) (3 Ergebnisse)

ISBN
Mit der Detailsuche verfeinern

Optimieren Sie Ihre Suche

  • Bücher (3)

bis

Benutzerdefinierte Preisspanne (EUR)

bis

  • Sprache: Englisch

    Verlag: Springer, 2011

    3031004302 / 9783031004308

    • Softcover

    Anbieter: World of Books (was SecondSale), Montgomery, IL, USAWorld of Books (was SecondSale)

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Gebraucht - Gut

    EUR 32,16

     Versand gratis 
    Versand innerhalb von USA

    Anzahl: 1 verfügbar

    Zustand: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.

  • Sprache: Englisch

    Verlag: Springer, 2011

    3031004302 / 9783031004308

    • Softcover

    Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 42,59

    EUR 10,93 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: Mehr als 20 verfügbar

    Zustand: New. In English.

  • Sprache: Englisch

    Verlag: Springer, 2011

    3031004302 / 9783031004308

    • Softcover

    Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 55,23

    EUR 30,50 Versand 
    Versand von Deutschland nach USA

    Anzahl: 1 verfügbar

    Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.