Standard

A Multi-Step Model for Pie Cutting with Random Offers. / Mazalov, Vladimir; Yashin, Vladimir.

In: Mathematics, Vol. 12, No. 8, 1150, 2024.

Research output: Contribution to journal › Article › peer-review

Harvard

Mazalov, V & Yashin, V 2024, 'A Multi-Step Model for Pie Cutting with Random Offers', Mathematics, vol. 12, no. 8, 1150. https://doi.org/10.3390/math12081150

APA

Mazalov, V., & Yashin, V. (2024). A Multi-Step Model for Pie Cutting with Random Offers. Mathematics, 12(8), [1150]. https://doi.org/10.3390/math12081150

Vancouver

Mazalov V, Yashin V. A Multi-Step Model for Pie Cutting with Random Offers. Mathematics. 2024;12(8). 1150. https://doi.org/10.3390/math12081150

Author

Mazalov, Vladimir ; Yashin, Vladimir. / A Multi-Step Model for Pie Cutting with Random Offers. In: Mathematics. 2024 ; Vol. 12, No. 8.

BibTeX

@article{e6261c4112174ac49ade361d1d59a84c,
title = "A Multi-Step Model for Pie Cutting with Random Offers",
abstract = "The problem of dividing a pie between two persons is considered. An arbitration procedure for dividing the pie is proposed, in which the arbitrator is a random number generator. In this procedure, the arbitrator makes an offer to the players at each step, and the players can either accept or reject the arbitrator{\textquoteright}s offer. If there is no consensus, negotiations move on to the next step. At the same time, the arbitrator punishes the rejecting player by reducing the amount of the resource in favor of the consenting player. A subgame perfect equilibrium is found in the process.",
keywords = "fair pie cutting, arbitration procedure, consistent negotiations, punishment strategy, subgame perfect equilibrium, threshold strategies",
author = "Vladimir Mazalov and Vladimir Yashin",
year = "2024",
doi = "10.3390/math12081150",
language = "English",
volume = "12",
journal = "Mathematics",
issn = "2227-7390",
publisher = "MDPI AG",
number = "8",

}

RIS

TY - JOUR

T1 - A Multi-Step Model for Pie Cutting with Random Offers

AU - Mazalov, Vladimir

AU - Yashin, Vladimir

PY - 2024

Y1 - 2024

N2 - The problem of dividing a pie between two persons is considered. An arbitration procedure for dividing the pie is proposed, in which the arbitrator is a random number generator. In this procedure, the arbitrator makes an offer to the players at each step, and the players can either accept or reject the arbitrator’s offer. If there is no consensus, negotiations move on to the next step. At the same time, the arbitrator punishes the rejecting player by reducing the amount of the resource in favor of the consenting player. A subgame perfect equilibrium is found in the process.

AB - The problem of dividing a pie between two persons is considered. An arbitration procedure for dividing the pie is proposed, in which the arbitrator is a random number generator. In this procedure, the arbitrator makes an offer to the players at each step, and the players can either accept or reject the arbitrator’s offer. If there is no consensus, negotiations move on to the next step. At the same time, the arbitrator punishes the rejecting player by reducing the amount of the resource in favor of the consenting player. A subgame perfect equilibrium is found in the process.

KW - fair pie cutting

KW - arbitration procedure

KW - consistent negotiations

KW - punishment strategy

KW - subgame perfect equilibrium

KW - threshold strategies

U2 - 10.3390/math12081150

DO - 10.3390/math12081150

M3 - Article

VL - 12

JO - Mathematics

JF - Mathematics

SN - 2227-7390

IS - 8

M1 - 1150

ER -

ID: 134787774