Brandon Williams
Alistair Wilson
Richard Van Weelden
BEEMA9, Lehigh University
September 12, 2025
Setup
Theory
Kartik, Kleiner, Van Weelden (2021)
0
1
Proposer
0
1
Proposer
0
1
\( \theta \)
Vetoer
0
1
Proposer
Vetoer
0
1
Proposer
\( \theta \)
???
0
1
\( \theta \)
???
0
1
\( \theta \)
0
1
0
\( \theta \)
1
0
\( \theta \)
1
Vetoer
Proposer
0
1
Proposer
Offer \( y \)
\( \frac{ y}{2} \)
These \( \theta \)-types veto
These \( \theta \)-types choose offer
\( z = 0 \)
\( z = y \)
0
1
Proposer
Offer \( y \)
\( \frac{ y}{2} \)
Breakdown:
inefficient as \( \theta > 0 \)
Suboptimal:
inefficient as \( \theta > y \)
preferred by both
0
1
\( \frac{ y}{2} \)
\(f(\theta)\)
\( y \)
\( z = y \)
\( z = 0 \)
0
\( \theta \)
1
0
\( \theta \)
1
Vetoer
Proposer
0
1
\( \frac{ y}{2} \)
These \( \theta \)-types veto
These \( \theta \)-types
choose minimum offer
\( z = 0 \)
\( z = y \)
Offer \( [y,1] \)
\( y \)
These \( \theta \)-types
choose their preferred
\( z = \theta \)
0
1
\( \frac{ y}{2} \)
Offer \( [y,1] \)
\( y \)
No suboptimality:
The delegation mechanism ensures
these options are available
Breakdown:
inefficient as \( \theta > 0 \)
0
1
\(f(\theta)\)
\( \frac{ y}{2} \)
\( y \)
0
1
\(\tfrac{y}{2}\)
\(y\)
\(f(\theta)\)
0
1
\(\tfrac{y}{2}\)
\(y\)
\(f(\theta)\)
Experiment
Delegation treatment:
offer a range
Take it or leave it:
single offer
| No Chat | Chat | |
| Take-it-or-leave-it | N=66 | N=60 |
| Delegation | N=64 | N=66 |
Results
Low
Middle
High
Low
Middle
High
Low
Middle
High
Minimal offer in interval:
Low
Middle
High
Minimal offer in interval:
Low
Middle
High
Low
Middle
High
TIOLI
Delegation
TIOLI
Delegation
TIOLI
Delegation
TIOLI
Delegation
What is the effect of communication?
Why do we see behavioral deviations from theory?