Resource monotonicity

Last updated

Resource monotonicity (RM; aka aggregate monotonicity) is a principle of fair division. It says that, if there are more resources to share, then all agents should be weakly better off; no agent should lose from the increase in resources. The RM principle has been studied in various division problems. [1] :46–51 [2]

Contents

Allocating divisible resources

Single homogeneous resource, general utilities

Suppose society has units of some homogeneous divisible resource, such as water or flour. The resource should be divided among agents with different utilities. The utility of agent is represented by a function ; when agent receives units of resource, he derives from it a utility of . Society has to decide how to divide the resource among the agents, i.e, to find a vector such that: .

Two classic allocation rules are the egalitarian rule - aiming to equalize the utilities of all agents (equivalently: maximize the minimum utility), and the utilitarian rule - aiming to maximize the sum of utilities.

The egalitarian rule is always RM: [1] :47 when there is more resource to share, the minimum utility that can be guaranteed to all agents increases, and all agents equally share the increase. In contrast, the utilitarian rule might be not RM.

For example, suppose there are two agents, Alice and Bob, with the following utilities:

The egalitarian allocation is found by solving the equation: , which is equivalent to , so is monotonically increasing with . An equivalent equation is: , which is equivalent to , so too is monotonically increasing with . So in this example (as always) the egalitarian rule is RM.

In contrast, the utilitarian rule is not RM. This is because Alice has increasing returns: her marginal utility is small when she has few resources, but it increases fast when she has many resources. Hence, when the total amount of resource is small (specifically, ), the utilitarian sum is maximized when all resources are given to Bob; but when there are many resources (), the maximum is attained when all resources are given to Alice. Mathematically, if is the amount given to Alice, then the utilitarian sum is . This function has only an internal minimum point but not an internal maximum point; its maximum point in the range is attained in one of the endpoints. It is the left endpoint when and the right endpoint when . In general, the utilitarian allocation rule is RM when all agents have diminishing returns, but it may be not RM when some agents have increasing returns (as in the example). [1] :46–47

Thus, if society uses the utilitarian rule to allocate resources, then Bob loses value when the amount of resources increases. This is bad because it gives Bob an incentive against economic growth: Bob will try to keep the total amount small in order to keep his own share large.

Two complementary resources, Leontief utilities

Consider a cloud server with some units of RAM and CPU. There are two users with different types of tasks:

Thus, the utility functions (=number of tasks), denoting RAM by r and CPU by c, are Leontief utilities:

If the server has 12 RAM and 12 CPU, then both the utilitarian and the egalitarian allocations (and also the Nash-optimal, max-product allocation) are:

Now, suppose 12 more units of CPU become available. The egalitarian allocation does not change, but the utilitarian allocation now gives all resources to Alice:

so Bob loses value from the increase in resources.

The Nash-optimal (max-product) allocation becomes:

so Bob loses value here too, but the loss is less severe. [1] :83–84

Cake cutting, additive utilities

In the fair cake-cutting problem, classic allocation rules such as divide and choose are not RM. Several rules are known to be RM:

Single-peaked preferences

Resource-monotonicity was studied in problems of fair division with single-peaked preferences. [5] [6]

Allocating discrete items

Identical items, general utilities

The egalitarian rule (maximizing the leximin vector of utilities) might be not RM when the resource to divide consists of several indivisible (discrete) units.

For example, [1] :82 suppose there are tennis rackets. Alice gets a utility of 1 whenever she has a racket, since she enjoys playing against the wall. But Bob and Carl get a utility of 1 only when they have two rackets, since they only enjoy playing against each other or against Alice. Hence, if there is only one racket, the egalitarian rule gives it entirely to Alice. But if there are two rackets, they are divided equally between the agents (each agent gets a racket for 2/3 of the time). Hence, Alice loses utility when the total amount of rackets increases. Alice has an incentive to oppose growth.

Different items, additive utilities

In the fair item allocation problem, classic allocation procedures such as adjusted winner and envy-graph are not RM. Moreover, even the Nash-optimal rule, which is RM in cake-cutting, is not RM in item allocation. In contrast, round-robin item allocation is RM. Moreover, round-robin can be adapted to yield picking sequences appropriate for agents with different entitlements; all these picking sequences are RM too. [7]

Identical items, additive utilities

The special case in which all items are identical and each agent's utility is simply the number of items he receives is known as apportionment. It originated from the task of allocating seats in a parliament among states or among parties. Therefore, it is often called house monotonicity .

Facility location

Facility location is the social choice question is where a certain facility should be located. Consider the following network of roads, where the letters denote junctions and the numbers denote distances:

A---6---B--5--C--5--D---6---E

The population is distributed uniformly along the roads. People want to be as close as possible to the facility, so they have "dis-utility" (negative utility) measured by their distance to the facility.

In the initial situation, the egalitarian rule locates the facility at C, since it minimizes the maximum distance to the facility, which is 11 (the utilitarian and Nash rules also locate the facility at C).

Now, there is a new junction X and some new roads (the previous roads do not change):

B--3--X--3--D
..........|.........
..........4.........
..........|.........
..........C.........

The egalitarian rule now locates the facility at X, since it allows to decrease the maximum distance from 11 to 9 (the utilitarian and Nash rules also locate the facility at X).

The increase in resources helped most people, but decreased the utility of those living in or near C. [1] :84–85

Bargaining

A monotonicity axiom closely related to resource-monotonicity appeared first in the context of the bargaining problem. A bargaining problem is defined by a set of alternatives; a bargaining solution should select a single alternative from the set, subject to some axioms. The resource-monotonicity axiom was presented in two variants:

  1. "If, for every utility level that player 1 may demand, the maximum feasible utility level that player 2 can simultaneously reach is increased, then the utility level assigned to player 2 according to the solution should also be increased". This axiom leads to a characterization of the Kalai–Smorodinsky bargaining solution.
  2. "Let T and S be bargaining games; if T contains S then for all agents, the utility in T is weakly larger than the utility in S". In other words, if the set of alternatives grows, the selected solution should be at least as good for all agents as the previous solution. This axiom, in addition to Pareto optimality and symmetry and Independence of irrelevant alternatives, leads to a characterization of the egalitarian bargaining solution. [8]

See also

[9] [10] [11] [12] [13] [14] [15] [16]

Related Research Articles

Pareto efficiency or Pareto optimality is a situation where no action or allocation is available that makes one individual better off without making another worse off. The concept is named after Vilfredo Pareto (1848–1923), Italian civil engineer and economist, who used the concept in his studies of economic efficiency and income distribution. The following three concepts are closely related:

Cooperative bargaining is a process in which two people decide how to share a surplus that they can jointly generate. In many cases, the surplus created by the two players can be shared in many ways, forcing the players to negotiate which division of payoffs to choose. Such surplus-sharing problems are faced by management and labor in the division of a firm's profit, by trade partners in the specification of the terms of trade, and more.

In social choice and operations research, the utilitarian rule is a rule saying that, among all possible alternatives, society should pick the alternative which maximizes the sum of the utilities of all individuals in society. It is a formal mathematical representation of the utilitarian philosophy.

Efficient cake-cutting is a problem in economics and computer science. It involves a heterogeneous resource, such as a cake with different toppings or a land with different coverings, that is assumed to be divisible - it is possible to cut arbitrarily small pieces of it without destroying their value. The resource has to be divided among several partners who have different preferences over different parts of the cake, i.e., some people prefer the chocolate toppings, some prefer the cherries, some just want as large a piece as possible, etc. The allocation should be economically efficient. Several notions of efficiency have been studied:

Equitable (EQ) cake-cutting is a kind of a fair cake-cutting problem, in which the fairness criterion is equitability. It is a cake-allocation in which the subjective value of all partners is the same, i.e., each partner is equally happy with his/her share. Mathematically, that means that for all partners i and j:

Fair item allocation is a kind of the fair division problem in which the items to divide are discrete rather than continuous. The items have to be divided among several partners who potentially value them differently, and each item has to be given as a whole to a single person. This situation arises in various real-life scenarios:

Efficiency and fairness are two major goals of welfare economics. Given a set of resources and a set of agents, the goal is to divide the resources among the agents in a way that is both Pareto efficient (PE) and envy-free (EF). The goal was first defined by David Schmeidler and Menahem Yaari. Later, the existence of such allocations has been proved under various conditions.

Utilitarian cake-cutting is a rule for dividing a heterogeneous resource, such as a cake or a land-estate, among several partners with different cardinal utility functions, such that the sum of the utilities of the partners is as large as possible. It is a special case of the utilitarian social choice rule. Utilitarian cake-cutting is often not "fair"; hence, utilitarianism is often in conflict with fair cake-cutting.

Fair division of a single homogeneous resource is one of the simplest settings in fair division problems. There is a single resource that should be divided between several people. The challenge is that each person derives a different utility from each amount of the resource. Hence, there are several conflicting principles for deciding how the resource should be divided. A primary conflict is between efficiency and equality. Efficiency is represented by the utilitarian rule, which maximizes the sum of utilities; equality is represented by the egalitarian rule, which maximizes the minimum utility.

The Kalai–Smorodinsky (KS) bargaining solution is a solution to the Bargaining problem. It was suggested by Ehud Kalai and Meir Smorodinsky, as an alternative to Nash's bargaining solution suggested 25 years earlier. The main difference between the two solutions is that the Nash solution satisfies independence of irrelevant alternatives while the KS solution satisfies monotonicity.

Envy-free (EF) item allocation is a fair item allocation problem, in which the fairness criterion is envy-freeness - each agent should receive a bundle that they believe to be at least as good as the bundle of any other agent.

In economics, dichotomous preferences (DP) are preference relations that divide the set of alternatives to two subsets: "Good" versus "Bad".

Egalitarian equivalence (EE) is a criterion of fair division. In an egalitarian-equivalent division, there exists a certain "reference bundle" such that each agent feels that his/her share is equivalent to .

Rank-maximal (RM) allocation is a rule for fair division of indivisible items. Suppose we have to allocate some items among people. Each person can rank the items from best to worst. The RM rule says that we have to give as many people as possible their best (#1) item. Subject to that, we have to give as many people as possible their next-best (#2) item, and so on.

Truthful resource allocation is the problem of allocating resources among agents with different valuations over the resources, such that agents are incentivized to reveal their true valuations over the resources.

When allocating objects among people with different preferences, two major goals are Pareto efficiency and fairness. Since the objects are indivisible, there may not exist any fair allocation. For example, when there is a single house and two people, every allocation of the house will be unfair to one person. Therefore, several common approximations have been studied, such as maximin-share fairness (MMS), envy-freeness up to one item (EF1), proportionality up to one item (PROP1), and equitability up to one item (EQ1). The problem of efficient approximately fair item allocation is to find an allocation that is both Pareto-efficient (PE) and satisfies one of these fairness notions. The problem was first presented at 2016 and has attracted considerable attention since then.

Online fair division is a class of fair division problems in which the resources, or the people to whom they should be allocated, or both, are not all available when the allocation decision is made. Some situations in which not all resources are available include:

In social choice and operations research, the egalitarian rule is a rule saying that, among all possible alternatives, society should pick the alternative which maximizes the minimum utility of all individuals in society. It is a formal mathematical representation of the egalitarian philosophy. It also corresponds to John Rawls' principle of maximizing the welfare of the worst-off individual.

Egalitarian cake-cutting is a kind of fair cake-cutting in which the fairness criterion is the egalitarian rule. The cake represents a continuous resource, that has to be allocated among people with different valuations over parts of the resource. The goal in egalitarian cake-cutting is to maximize the smallest value of an agent; subject to this, maximize the next-smallest value; and so on. It is also called leximin cake-cutting, since the optimization is done using the leximin order on the vectors of utilities.

Population monotonicity (PM) is a principle of consistency in allocation problems. It says that, when the set of agents participating in the allocation changes, the utility of all agents should change in the same direction. For example, if the resource is good, and an agent leaves, then all remaining agents should receive at least as much utility as in the original allocation.

References

  1. 1 2 3 4 5 6 Herve Moulin (2004). Fair Division and Collective Welfare. Cambridge, Massachusetts: MIT Press. ISBN   9780262134231.
  2. Thomson, William (2011). Fair Allocation Rules. Handbook of Social Choice and Welfare. Vol. 2. pp. 393–506. doi:10.1016/s0169-7218(10)00021-3. ISBN   9780444508942.
  3. Segal-Halevi, Erel; Sziklai, Balázs R. (2019-09-01). "Monotonicity and competitive equilibrium in cake-cutting". Economic Theory. 68 (2): 363–401. arXiv: 1510.05229 . doi:10.1007/s00199-018-1128-6. ISSN   1432-0479. S2CID   179618.
  4. Segal-Halevi, Erel; Sziklai, Balázs R. (2018-09-01). "Resource-monotonicity and population-monotonicity in connected cake-cutting". Mathematical Social Sciences. 95: 19–30. arXiv: 1703.08928 . doi:10.1016/j.mathsocsci.2018.07.001. ISSN   0165-4896. S2CID   16282641.
  5. Thomson, William (1994). "Resource-monotonic solutions to the problem of fair division when preferences are single-peaked". Social Choice and Welfare. 11 (3). doi:10.1007/bf00193807. S2CID   122306487.
  6. Thomson, William (1997). "The Replacement Principle in Economies with Single-Peaked Preferences". Journal of Economic Theory. 76: 145–168. doi: 10.1006/jeth.1997.2294 .
  7. Chakraborty, Mithun; Schmidt-Kraepelin, Ulrike; Suksompong, Warut (2021-04-29). "Picking sequences and monotonicity in weighted fair division". Artificial Intelligence. 301: 103578. arXiv: 2104.14347 . doi:10.1016/j.artint.2021.103578. S2CID   233443832.
  8. Kalai, Ehud (1977). "Proportional solutions to bargaining situations: Intertemporal utility comparisons" (PDF). Econometrica . 45 (7): 1623–1630. doi:10.2307/1913954. JSTOR   1913954.
  9. Mantel, Rolf R. (1984). "Substitutability and the welfare effects of endowment increases". Journal of International Economics. 17 (3–4): 325–334. doi:10.1016/0022-1996(84)90027-8.
  10. Moulin, Hervé (1992). "Welfare bounds in the cooperative production problem". Games and Economic Behavior. 4 (3): 373–401. doi:10.1016/0899-8256(92)90045-t.
  11. Polterovich, V.M.; Spivak, V.A. (1983). "Gross substitutability of point-to-set correspondences". Journal of Mathematical Economics. 11 (2): 117. doi:10.1016/0304-4068(83)90032-0.
  12. Sobel, Joel (1979). "Fair allocations of a renewable resource". Journal of Economic Theory. 21 (2): 235–248. CiteSeerX   10.1.1.394.9698 . doi:10.1016/0022-0531(79)90029-2.
  13. Moulin, Hervé; Thomson, William (1988). "Can everyone benefit from growth?". Journal of Mathematical Economics. 17 (4): 339. doi:10.1016/0304-4068(88)90016-x.
  14. Moulin, Herve (1992). "An Application of the Shapley Value to Fair Division with Money". Econometrica. 60 (6): 1331–1349. doi:10.2307/2951524. JSTOR   2951524.
  15. Moulin, H. (1990). "Fair division under joint ownership: Recent results and open problems". Social Choice and Welfare. 7 (2): 149–170. doi:10.1007/bf01560582. S2CID   154300207.
  16. Moulin, Hervé (1991). "Welfare bounds in the fair division problem". Journal of Economic Theory. 54 (2): 321–337. doi:10.1016/0022-0531(91)90125-n.