Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Shapley-like values without symmetry (1809.07747v2)

Published 20 Sep 2018 in econ.TH and math.CO

Abstract: Following the work of Lloyd Shapley on the Shapley value, and tangentially the work of Guillermo Owen, we offer an alternative non-probabilistic formulation of part of the work of Robert J. Weber in his 1978 paper "Probabilistic values for games." Specifically, we focus upon efficient but not symmetric allocations of value for cooperative games. We retain standard efficiency and linearity, and offer an alternative condition, "reasonableness," to replace the other usual axioms. In the pursuit of the result, we discover properties of the linear maps that describe the allocations. This culminates in a special class of games for which any other map that is "reasonable, efficient" can be written as a convex combination of members of this special class of allocations, via an application of the Krein-Milman theorem.

Summary

We haven't generated a summary for this paper yet.