Metraipolis › archive › dc_19aa2bb717fb

Strategic fair division — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Strategic_fair_division
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-06T00:45:46.882Z
SHA-256 of the archived text: bd65f878f2fdd4b74e938261835ee13e86ac92e40e97b11da0d160291506cdcb
Stable URL of this page: https://metraipolis.com/documento/dc_19aa2bb717fb

How to cite

Strategic fair division — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Strategic_fair_division (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_19aa2bb717fb (Metraipolis archive dc_19aa2bb717fb, sha256 bd65f878f2fdd4b74e938261835ee13e86ac92e40e97b11da0d160291506cdcb)

BibTeX

@misc{dc19aa2bb717fb,
  title = {Strategic fair division — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Strategic_fair_division},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_19aa2bb717fb; sha256 bd65f878f2fdd4b74e938261835ee13e86ac92e40e97b11da0d160291506cdcb},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Strategic_fair_division. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Strategic fair division studies problems of fair division, in which participants cooperate to subdivide goods or resources fairly, from a point of view in which the participants are assumed to hide their preferences and act strategically in order to maximize their own utility, rather than playing sincerely according to their true preferences. To illustrate the difference between strategic fair division and classic fair division, consider the divide and choose procedure for dividing a cake among two agents. In classic fair division, it is assumed that the cutter cuts the cake into two pieces that are equal in his eyes, and thus he always gets a piece that he values at exactly 1/2 of the total cake value. However, if the cutter knows the chooser's preferences, he can get much more than 1/2 by acting strategically. For example, suppose the cutter values a piece by its size while the chooser values a piece by the amount of chocolate in it. So the cutter can cut the cake into two pieces with almost the same amount of chocolate, such that the smaller piece has slightly more chocolate. Then, the chooser will take the smaller piece and the cutter will win the larger piece, which may be worth much more than 1/2 (depending on how the chocolate is distributed). The research in strategic fair division has two main branches. One branch is related to game theory and studies the equilibria in games created by fair division algorithms: The Nash equilibrium of the Dubins-Spanier moving-knife protocol; The Nash equilibrium and subgame-perfect equilibrium of generalized-cut-and-choose protocols; The equilibria of envy-free protocols for allocating an indivisible good with monetary compensations. The price of anarchy of Nash equilibria of two mechanisms for homogeneous-resource allocation: the Fisher market game and the Trading Post game. The other branch is related to mechanism design and aims to find truthful mechanisms for fair division, in particular: Truthful cake-cutting; Truthful resource allocation; Truthful fair division of rooms and rent.

Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; ricerca «autonomous agent»).
Fonte: Wikipedia in inglese, voce «Strategic fair division» — https://en.wikipedia.org/wiki/Strategic_fair_division
Wikidata Q85803675: «game theory problem» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q85803675
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Strategic_fair_division?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375915724, consultata il 2026-10-05T23:59:30.749Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fdc3d1b33d5f0a6c9ae782ed97f1604b00d16685886bf7faa9d4431bd3f7b944