In this paper we consider a sequential allocation problem with n individuals. The first individual can consume any amount of some endowment leaving the remaining for the second individual, and so on. Motivated by the limitations associated with the cooperative or non-cooperative solutions we...

Multiple Criteria Decision Aiding (MCDA) has been studied in a single decision maker framework for a long time. Nowadays, the need to take into account several conflicting opinions handled by several decisions makers arises. So, researchers are interested with multicriteria problems involving...

The first result in this paper says that given any efficient non-monetary allocation there is a balanced vector of transfers so that the resulting allocation is fair. The second result here says that given any efficient non-monetary allocation there is a pricing function defined on consumption...

The first result in this paper says that given any efficient non-monetary allocation there is a balanced vector of transfers so that the resulting allocation is fair. The second result here says that given any efficient non-monetary allocation there is a pricing function defined on consumption...

Sub-Saharan Africa (SSA) accounts for a third of the countries on the Financial Action Task Force (FATF) grey list. In the Money Laundering and Terrorist Financing (ML/TF) Ranking and Risk Assessment Tool, the region performed poorly in terms of resilience to ML/TF, with more than 60% of...

Sub-Saharan Africa (SSA) accounts for a third of the countries on the Financial Action Task Force (FATF) grey list. In the Money Laundering and Terrorist Financing (ML/TF) Ranking and Risk Assessment Tool, the region performed poorly in terms of resilience to ML/TF, with more than 60% of...

We propose a procedure for dividing indivisible items between two players in which each player ranks the items from best to worst and has no information about the other player’s ranking. It ensures that each player receives a subset of items that it values more than the other player’s...

We study the problem of dissolving an equal-entitlement partnership when the objective is to minimize maximum regret. We initially focus on the family of linear-pricing mechanisms and derive regret-optimizing strategies. We also demonstrate that there exist linear-pricing mechanisms satisfying...

Barbanel, Brams, and Stromquist (2009) asked whether there exists a two-person moving-knife procedure that yields an envy-free, undominated, and equitable allocation of a pie. We present two procedures: One yields an envy-free, almost undominated, and almost equitable allocation, whereas the...

We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation--as these terms are used in the...