Skip to Main content Skip to Navigation
Journal articles

Assignment of heterogeneous agents in trees under the permission value

Abstract : We investigate assignment of heterogeneous agents in trees where the payoff is given by the permission value. We focus on optimal hierarchies, namely those, for which the payoff of the top agent is maximized. For additive games, such hierarchies are always cogent, namely, more productive agents occupy higher positions. The result can be extended to non-additive games with appropriate restrictions on the value function. Next, we consider auctions where agents bid for positions in a vertical hierarchy of depth 2 . Under standard auctions, usually this results in a non-cogent hierarchy.
Complete list of metadata
Contributor : Isabelle Celet Connect in order to contact the contributor
Submitted on : Friday, March 6, 2020 - 3:31:01 PM
Last modification on : Tuesday, April 12, 2022 - 4:12:04 PM

Links full text




Subhadip Chakrabarti, Amandine Ghintran, Rajnish Kumar. Assignment of heterogeneous agents in trees under the permission value. Review of Economic Design, Springer Verlag, 2019, 23 (3-4), pp.155-188. ⟨10.1007/s10058-019-00226-y⟩. ⟨hal-02501134⟩



Record views