pathawards {ClaimsProblems} | R Documentation |
The path of awards for two claimants
Description
This function returns the graphical representation of the path of awards of any rule for a claims vector and a pair of claimants.
Usage
pathawards(d, claimants, Rule, col = "red", points = 201)
Arguments
d |
The vector of claims. |
claimants |
Two claimants. |
Rule |
The rule: AA, APRO, CE, CEA, CEL, DT, MO, PIN, PRO, RA, Talmud. |
col |
The colour. |
points |
The number of values of the endowment to draw the path. |
Details
Let d\in \mathcal{R}^n
, with d\ge 0
, be a vector of claims and
denote D=\sum_{i=1}^{n} d_i
the sum of claims.
The path of awards of a rule R
for two claimants i
and j
is the parametric curve:
p(E)=\{(R_i(E,d),R_j(E,d))\in \mathcal{R}^2:\;E\in[0,D]\}.
Value
The graphical representation of the path of awards of a rule for the given claims and a pair of claimants.
References
Thomson, W. (2019). How to divide when there isn't enough. From Aristotle, the Talmud, and Maimonides to the axiomatics of resource allocation. Cambridge University Press.
See Also
pathawards3, schedrule, schedrules, verticalruleplot
Examples
d=c(2,4,7,8)
claimants=c(1,2)
Rule=Talmud
pathawards(d,claimants,Rule)
# The path of awards of the concede-and-divide rule
pathawards(c(2,3),c(1,2),CD)
#The path of awards of the DT rule for d=(d1,d2) with d2<2d1
pathawards(c(1,1.5),c(1,2),DT,col="blue",points=1001)
#The path of awards of the DT rule for d=(d1,d2) with d2>2d1
pathawards(c(1,2.5),c(1,2),DT,col="blue",points=1001)