RandomArrival: Random Arrival Rule

In GameTheory: Cooperative Game Theory

Random Arrival Rule

Description

This function calculates how to distribute a given endowment by the Random Arrival rule.

Usage

RandomArrival(E, C, Names = NULL)

Arguments

E	Endowment
C	Claims of the agents
Names	Labels of the agents

Details

The random arrival rule (O'Neill, 1982) works in the following fashion: suppose that each claim is fully honored until the endowment runs out following the order of the claimants arrival. In order to remove the unfairness of the first-come first-serve scheme associated with any particular order of arrival, the rule proposes to take the average of the awards vectors calculated in this way when all orders are equally probable.

Note

In order to calculate the rule properly, input the claims of the agents in ascending order.

Author(s)

Sebastian Cano-Berlanga <[e-mail]>

References

O'Neill B. (1982). "A problem of rights arbitration from the Talmud." Mathematical Social Sciences, 2(4), pp.345–371.

GameTheory documentation built on Sept. 25, 2023, 5:07 p.m.