2008
DOI: 10.1016/j.geb.2008.01.006
|View full text |Cite
|
Sign up to set email alerts
|

Strategic divide and choose

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
20
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(21 citation statements)
references
References 16 publications
1
20
0
Order By: Relevance
“…Chen et al (2013) also design a more intricate deterministic strategyproof envy-free algorithm for piecewise uniform valuation functions, which is generalized by Aziz and Ye (2014); under the same assumption, Maya and Nisan (2012) give a characterization of strategyproof, Pareto-efficient cake cutting algorithms. Nash equilibria of cake cutting algorithms are studied by Nicolò and Yu (2008) and Brânzei and Miltersen (2013).…”
Section: Bibliography and Further Readingmentioning
confidence: 99%
“…Chen et al (2013) also design a more intricate deterministic strategyproof envy-free algorithm for piecewise uniform valuation functions, which is generalized by Aziz and Ye (2014); under the same assumption, Maya and Nisan (2012) give a characterization of strategyproof, Pareto-efficient cake cutting algorithms. Nash equilibria of cake cutting algorithms are studied by Nicolò and Yu (2008) and Brânzei and Miltersen (2013).…”
Section: Bibliography and Further Readingmentioning
confidence: 99%
“…But other profiles are also PO in this sense. There are multi-stage variants of Ultimatum where players take turns proposing divisions of the resource (Nicolò and Yu, 2008), with players exchanging roles as determined by a third party controlling the experiment (Cason and Mui, 1998).…”
mentioning
confidence: 99%
“…For two players, this is the familiar "divide and choose" method, where one player cuts the cake, and the other gets to choose (Brams andTaylor, 1996, Robertson andWebb, 1998). For three or more players this is a little more complex, but strategies for both exact and approximate solutions exist (Nicolò and Yu, 2008).…”
Section: Insights From Game Theorymentioning
confidence: 99%
“…they ought to make people happy enough), they are not necessarily equitable in terms of equal utility: each stakeholders subjective valuation of their own piece is not necessarily equal to the others' own subjective valuation of their respective pieces (Nicolò and Yu, 2008). These issues can be illustrated by the simple two player cut and choose method: when the other players preference is not known, then this will result in a solution in which each player gets at least 50% of their perceived total value of the cake.…”
Section: Insights From Game Theorymentioning
confidence: 99%
See 1 more Smart Citation