000695915 000__ 03341cam\a2200457Ki\4500
000695915 001__ 695915
000695915 005__ 20230306135504.0
000695915 006__ m\\\\\o\\d\\\\\\\\
000695915 007__ cr\cnu|||unuuu
000695915 008__ 131204s2014\\\\gw\a\\\\ob\\\\001\0\eng\d
000695915 0167_ $$a016556166$$2Uk
000695915 020__ $$a9783642395499 $$qelectronic book
000695915 020__ $$a364239549X $$qelectronic book
000695915 020__ $$z9783642395482
000695915 0247_ $$a10.1007/978-3-642-39549-9$$2doi
000695915 035__ $$aSP(OCoLC)ocn864679644
000695915 035__ $$aSP(OCoLC)864679644
000695915 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dUKMGB$$dIDEBK$$dN$T$$dYDXCP$$dCOO
000695915 049__ $$aISEA
000695915 050_4 $$aQA272.4
000695915 08204 $$a519.3$$223
000695915 1001_ $$aMeinhardt, Holger Ingmar,$$eauthor.
000695915 24514 $$aThe pre-kernel as a tractable solution for cooperative games$$h[electronic resource] :$$ban exercise in algorithmic game theory /$$cHolger Ingmar Meinhardt.
000695915 264_1 $$aHeidelberg :$$bSpringer,$$c2014.
000695915 300__ $$a1 online resource (xxxiii, 242 pages) :$$billustrations (some color).
000695915 336__ $$atext$$btxt$$2rdacontent
000695915 337__ $$acomputer$$bc$$2rdamedia
000695915 338__ $$aonline resource$$bcr$$2rdacarrier
000695915 4901_ $$aTheory and decision library. Series C, Game theory, mathematical programming, and operations research,$$x0924-6126 ;$$vvolume 45
000695915 504__ $$aIncludes bibliographical references and indexes.
000695915 5050_ $$aSome Solution Schemes and Game Properties -- The Shapley Value and (Pre-Kernel) as a Fairness Concept -- Fair Division in Cournot Markets -- Some Preliminary Results -- A Pre-Kernel Characterization and Orthogonal Projection -- Characterization of the Pre-Kernel by Solution Sets -- Algorithms for Computing the Pre-Kernel -- An Upper Dimension Bound of the Pre-Kernel -- Concluding Remarks.
000695915 506__ $$aAccess limited to authorized users.
000695915 520__ $$aThis 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.
000695915 588__ $$aDescription based on online resource; title from PDF title page (SpringerLink, viewed October 28, 2013).
000695915 650_0 $$aGame theory.
000695915 650_0 $$aKernel functions.
000695915 830_0 $$aTheory and decision library.$$nSeries C,$$pGame theory, mathematical programming, and operations research ;$$vv.45.$$x0924-6126
000695915 85280 $$bebk$$hSpringerLink
000695915 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://dx.doi.org/10.1007/978-3-642-39549-9$$zOnline Access
000695915 909CO $$ooai:library.usi.edu:695915$$pGLOBAL_SET
000695915 980__ $$aEBOOK
000695915 980__ $$aBIB
000695915 982__ $$aEbook
000695915 983__ $$aOnline
000695915 994__ $$a92$$bISE