R. Acosta Vega, E. Algaba, J. SANCHEZ SORIANO

In this paper, we analyze the problem of how to adapt the concept of priority to situations where several perfectly divisible resources have to be allocated among certain set of agents that have exactly one claim which is used for all resources. In particular, we introduce constrained sequential priority rules and two constrained random arrival rules, which extend the classical sequential priority rules and the random arrival rule to these situations. Moreover, we provide an axiomatic analysis of these rules.

Keywords: Allocation problem, multi-issue bankruptcy problems, sequential priority rule, random arrival rule

Scheduled

GT19.GAMES3
November 9, 2023  3:30 PM
CC2: Conference Room


Other papers in the same session


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.