Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Shapley Value in the Knaster Gain Game (1602.08068v4)

Published 19 Feb 2016 in math.OC and cs.GT

Abstract: In Briata, Dall'Aglio and Fragnelli (2012), the authors introduce a cooperative game with transferable utility for allocating the gain of a collusion among completely risk-averse agents involved in the fair division procedure introduced by Knaster (1946). In this paper we analyze the Shapley value (Shapley, 1953) of the game and propose its use as a measure of the players' attitude towards collusion. Furthermore, we relate the sign of the Shapley value with the ranking order of the players' evaluation, and show that some players in a given ranking will always deter collusion. Finally, we characterize the coalitions that maximize the gain from collusion, and suggest an ad-hoc coalition formation mechanism.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Federica Briata (1 paper)
  2. Andrea Dall'Aglio (2 papers)
  3. Marco Dall'Aglio (9 papers)
  4. Vito Fragnelli (2 papers)
Citations (7)

Summary

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