Skip to main content
  • Book
  • © 2014

The Pre-Kernel as a Tractable Solution for Cooperative Games

An Exercise in Algorithmic Game Theory

  • Characterizes a fair division rule of game theory by convex analysis
  • Proposes tractable formula to solve fair division problems in real life situations
  • Provides algorithms to implement vectorized and parallel computer programs designed to solve fair division problems?
  • Includes supplementary material: sn.pub/extras

Part of the book series: Theory and Decision Library C (TDLC, volume 45)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (10 chapters)

  1. Front Matter

    Pages i-xxxiii
  2. Introduction

    • Holger Ingmar Meinhardt
    Pages 1-6
  3. Some Solution Schemes and Game Properties

    • Holger Ingmar Meinhardt
    Pages 7-15
  4. The Shapley Value and (Pre-)Kernel as a Fairness Concept

    • Holger Ingmar Meinhardt
    Pages 17-25
  5. Fair Division in Cournot Markets

    • Holger Ingmar Meinhardt
    Pages 27-46
  6. Some Preliminary Results

    • Holger Ingmar Meinhardt
    Pages 47-61
  7. A Pre-Kernel Characterization and Orthogonal Projection

    • Holger Ingmar Meinhardt
    Pages 63-119
  8. Characterization of the Pre-Kernel by Solution Sets

    • Holger Ingmar Meinhardt
    Pages 121-168
  9. Algorithms for Computing the Pre-Kernel

    • Holger Ingmar Meinhardt
    Pages 169-215
  10. An Upper Dimension Bound of the Pre-Kernel

    • Holger Ingmar Meinhardt
    Pages 217-222
  11. Concluding Remarks

    • Holger Ingmar Meinhardt
    Pages 223-224
  12. Back Matter

    Pages 225-242

About this book

This present book provides an alternative approach to study the pre-kernel solution of transferable utility games based on a generalized conjugation theory from convex analysis. Although the pre-kernel solution possesses an appealing axiomatic foundation that lets one consider this solution concept as a standard of fairness, the pre-kernel and its related solutions are regarded as obscure and too technically complex to be treated as a real alternative to the Shapley value. Comprehensible and efficient computability is widely regarded as a desirable feature to qualify a solution concept apart from its axiomatic foundation as a standard of fairness. We review and then improve an approach to compute the pre-kernel of a cooperative game by the indirect function. The indirect function is known as the Fenchel-Moreau conjugation of the characteristic function. Extending the approach with the indirect function, we are able to characterize the pre-kernel of the grand coalition simply by the solution sets of a family of quadratic objective functions.

Authors and Affiliations

  • Karlsruhe Institute of Technology (KIT) Institute of Operations Research, Karlsruhe, Germany

    Holger Ingmar Meinhardt

About the author

Dr. Holger Meinhardt is a Senior Research Affiliate at Karlsruhe Institute of Technology (KIT).

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access