1998
DOI: 10.1007/s001990050184
|View full text |Cite
|
Sign up to set email alerts
|

Contest success functions: an extension

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
186
0

Year Published

1998
1998
2022
2022

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 293 publications
(187 citation statements)
references
References 4 publications
1
186
0
Order By: Relevance
“…8 Since we consider a …xed vector of e¤orts G, we will simply use the notation f i instead of f i (G i ) and f instead of f (G). An allocation in a contest problem is a n-tuple p = (p 1 ; :::; p n ) 2 R n with 0 p i 1 and P n i=1 p i = 1.…”
Section: ' Classical'bargainingmentioning
confidence: 99%
“…8 Since we consider a …xed vector of e¤orts G, we will simply use the notation f i instead of f i (G i ) and f instead of f (G). An allocation in a contest problem is a n-tuple p = (p 1 ; :::; p n ) 2 R n with 0 p i 1 and P n i=1 p i = 1.…”
Section: ' Classical'bargainingmentioning
confidence: 99%
“…17 Accordingly, relative standing considerations suggest that the disadvantaged player B may have a stronger incentive to reject the proposed split than the advantaged player A.…”
Section: Hypothesis 2 (Bargaining Mechanism)mentioning
confidence: 99%
“…Suppose first the case of settlement. Each challenger would receive in each period a settlement payment = (1 ) with the 10 Note that this value does not include the cost of which is considered to have been already paid. We continue the same practice in denoting values functions net of this cost below.…”
Section: B An Alternative Litigation Settingmentioning
confidence: 99%