Fair division experiments

Last updated

Various experiments have been made to evaluate various procedures for fair division, the problem of dividing resources among several people. These include case studies, computerized simulations, and lab experiments.

Contents

Case studies

Allocating indivisible heirlooms

1. Flood [1] : case 4  describes a division of a gift containing 5 parcels: whiskey, prunes, eggs, suitcase, etc. The division was done using the Knaster auction. The resulting division was fair, but in retrospect it was found that coalitions could gain from manipulation.

2. When Mary Anna Lee Paine Winsor died at the age of 93, her estate included two trunks of silver, that had to be divided among her 8 grandchildren. It was divided using a decentralized, fair and efficient allocation procedure, which combined market equilibrium and a Vickrey auction. Although most participants did not fully understand the algorithm or the preference information desired, it handled the major considerations well and was regarded as equitable. [2]

Allocating unused classrooms

In California, the law says that public school classrooms should be shared fairly among all public school pupils, including those in charter schools. Schools have dichotomous preferences: each school demands a certain number of classes, it is happy if it got all of them and unhappy otherwise. A new algorithm [3] allocates classrooms to schools using a non-trivial implementation of the randomized leximin mechanism. Unfortunately it was not deployed in practice, but it was tested using computer simulations based on real school data. While the problem is computationally-hard, simulations show that the implementation scales gracefully in terms of running time: even when there are 300 charter schools, it terminates in a few minutes on average. Moreover, while theoretically the algorithm guarantees only 1/4 of the maximum number of allocated classrooms, in the simulations it satisfies on average at least 98% of the maximum number of charter schools that can possibly be satisfied, and allocates on average at least 98% of the maximum number of classrooms that can possibly be allocated. [3]

The partial collaboration with the school district lead to several practical desiderata in deploying fair division solutions in practice. First, the simplicity of the mechanism, and the intuitiveness of the properties of proportionality, envy-freeness, Pareto optimality, and strategyproofness, have made the approach more likely to be adopted. On the other hand, the use of randomization, though absolutely necessary in order to guarantee fairness in allocating indivisible goods such as classrooms, has been a somewhat harder sell: the term "lottery" raised negative connotations and legal objections.

Resolving international conflicts

The adjusted winner procedure is a protocol for simultaneously resolving several issues under conflict, such that the agreement is envy-free, equitable, and Pareto efficient. It has been commercialized through the FairOutcomes Archived 2019-03-05 at the Wayback Machine website. While there are no account of it actually being used to resolve disputes, there are several counterfactual studies checking what would have been the results of using this procedure to solve international disputes:

Allocating rooms and rent

Rental harmony is the problem of simultaneously allocating rooms in an apartment and the rent of the apartment among the housemates. It has several solutions. Some of these solutions were implemented in the Spliddit.org website [7] and tested on real users. [8]

Sharing cooperation surplus

When different agents cooperate, there is an economic surplus in welfare. Cooperative game theory studies the question of how this surplus should be allocated, taking into account the various coalitional options of the players. Several cases of such cooperation has been studied, in light of concepts such as the Shapley value. [9]

Fair Bargaining

Flood [1] analyzed several cases of bargaining between a buyer and a seller on the price of purchasing a good (e.g. a car). He found that the "split-the-difference" principle was acceptable by both participants. The same cooperative principle was found in more abstract non-cooperative games. However, in some cases, bidders in an auction did not find a cooperative solution.

Fair Load-Shedding

Olabambo et al [10] develop heuristic algorithms for fair allocation of electricity disconnections in developing countries. They test the fairness and welfare of their algorithms on electricity usage data from Texas, which they adapt to the situation in Nigeria.

Computerized simulations

Fair cake-cutting

Walsh [11] developed several algorithms for online fair cake-cutting. He tested them using a computerized simulation: valuation functions for each agent were generated by dividing the cake into random segments, and assigning a random value to each segment, normalizing the total value of the cake. The egalitarian welfare and the utilitarian welfare of various algorithms were compared.

Shtechman, Gonen and Segal-Halevi [12] simulated two famous cake-cutting algorithms - Even–Paz and Last diminisher - on real land-value data from New Zealand and Israel. The agents' valuations were generated by taking the market value of each land-cell and adding a random "noise" based on two different noise models: uniform noise and hot-spot noise. They showed the algorithms perform better than two alternative processes for dividing land, namely selling the land and dividing the proceeds, and hiring a real-estate assessor.

Welfare redistribution mechanism

Cavallo [13] developed an improvement of the Vickrey–Clarke–Groves mechanism in which money is redistributed in order to increase social welfare. He tested his mechanism using simulations. He generated piecewise-constant valuation functions, whose constants were selected at random from the uniform distribution. He also tried Gaussian distributions and got similar results.

Fair item assignment

Dickerson, Goldman, Karp and Procaccia [14] use simulations to check under what conditions an envy-free assignment of discrete items is likely to exist. They generate instances by sampling the value of each item to each agent from two probability distributions: uniform and correlated. In the correlated sampling, they first sample an intrinsic value for each good, and then assign a random value to each agent drawn from a truncated nonnegative normal distribution around that intrinsic value. Their simulations show that, when the number of goods is larger than the number of agents by a logarithmic factor, envy-free allocations exist with high probability.

Segal-Halevi, Aziz and Hassidim [15] use simulations from similar distributions to show that, in many cases, there exist allocations that are necessarily fair based on a certain convexity assumption on the agents' preferences.

Laboratory experiments

Several experiments were conducted with people, in order to find out what is the relative importance of several desiderata in choosing an allocation.

Important concepts

James Konow [16] reviewed hundreds of experiments, done by phone interviews or written surveys, aimed at eliciting people's preferences and ideas regarding "what is fair?". Most experiments were done by presenting short stories (vignettes) to people and asking them whether the outcome is fair or unfair. The experiments revolved around four aspects of justice:

  1. Equality and Need: egalitarianism, Rawls' theory and the Social contract and Marxism. Konow claims that there is little evidence for these as a general fairness principle, except when considering the basic needs. He calls it the Principle of Need: just allocations provide for basic needs equally across individuals.
  2. Utilitarian and Welfare economics: utilitarianism, Pareto efficiency, envy-freeness. There is evidence that people want to maximize total surplus, even when it comes at a personal cost to them. This leads to the Principle of Efficiency: aiming to maximize the sum of derived values.
  3. Equity and moral Desert: Nozick's theory of choice, Buchanan's theory of moral desert, and the theory of equity, which says that the rewards should be proportional to the contributions. He defines the Principle of Equity, which generalizes the equity formula to the entitlement formula: the entitlement of each agent is based on his inputs, outputs, endowments and costs. His allocation should be proportional to the variables he controls, but not to exogeneous variables of which he has no control.
  4. Context: experiments show that the weighing of the above three principles depends on context. Aspects of context include past transactions (existing prices are usually considered "fair", particularly if they are stable and competitive). The endowment effect affects fairness: reducing someone's endowment is considered unfair. There are also information and framing effects: subjects may respond differently depending on what kind of information they are given on the situation. Theories of local justice say that people solve each instance of fair division locally, based on fairness principles relevant for that instance, emphasizing procedural fairness. Experiments find effects of scope, that is, determining the set of agents and the set of allocations to compare. There are differences between countries and cultures in the relative weight they assign to different fairness principles, as well as to related principles such as self-interest, love, altruism, and reciprocity.

Fairness vs. efficiency - what outcome is better?

Sometimes, there are only two possible allocations: one is fair (e.g. envy-free division) but inefficient, while the other is efficient (e.g. Pareto-optimal) but unfair. Which division do people prefer? This was tested in several lab experiments.

1. Subjects were given several possible allocations of money, and were asked which allocation they prefer. One experiment [17] found that the most important factors were Pareto-efficiency and Rawlsian motive for helping the poor (maximin principle). However, a later experiment found that these conclusions only hold for students of economics and business, who train to acknowledge the importance of efficiency. In the general population, the most important factors are selfishness and inequality aversion. [18]

2. Subjects were asked to answer questionnaires regarding the division of indivisible items between two people. The subjects were shown the subjective value that each (virtual) person attaches to each item. The predominant aspect considered was equity - satisfying each individual's preferences. The efficiency aspect was secondary. This effect was slightly more pronounced in economics students, and less pronounced in law students (who chose a Pareto-efficient allocation more frequently). [19]

3. Subjects were divided into pairs and asked to negotiate and decide how to divide a set of 4 items between them. Each combination of items had a pre-specified monetary value, which was different between the two subjects. Each subject knew both his own values and the partner's values. After the division, each subject could redeem the items for their monetary value. The items could be divided in several ways: some divisions were equitable (e.g., giving each partner a value of 45), while other divisions were Pareto efficient (e.g., giving one partner 46 and another partner 75). The interesting question was whether people prefer the equitable or the efficient division. The results showed that people preferred the more efficient division only if it was not "too unfair". A difference of 2-3 value units was considered sufficiently small for most subjects, so they preferred the efficient allocation. But a difference of 20-30 units (such as in the 45:45 vs. 46:75 example) was perceived as too large: 51% preferred the 45:45 division. The effect were less pronounced when the subjects were only shown the rank of the item combinations for each of them, rather than the full monetary value. This experiment also revealed a recurring process which was used during the negotiation: subjects first find the most equitable division of the goods. They take it as a reference point and try to find Pareto improvements. An improvement is implemented only if the inequality it causes is not too large. This process is called CPIES: Conditioned Pareto Improvement from Equal Split. [20]

Intra-personal vs. inter-personal fairness - which is more important?

What is the importance of intra-personal fairness criteria (such as envy-freeness, where each person compares bundles based only on his own utility-function), vs. inter-personal fairness criteria (such as equitability, where each person views the utilities of all other agents)? Using a free-form bargaining experiment, it was found that inter-personal fairness (e.g. equitability) is more important. Intra-personal fairness (such as envy-freeness) are relevant only as a secondary criterion. [21]

Fairness vs. simplicity

Divide and choose (DC) is a fair and very simple procedure. There are more sophisticated procedures that have better fairness guarantees. The question of which were more satisfactory was tested in several lab experiments.

1. Divide-and-choose vs Knaster-Brams-Taylor. Several pairs of players had to divide among them 3 indivisible goods (a ballpoint pen, a lighter and a mug) and some money. Three procedures were used: the simple DC, and the more complicated Adjusted Knaster (an improvement of adjusted winner) and Proportional Knaster. The authors asked the subjects to select their favorite procedure. Then, they let them play the procedure in two modes: binding (strict adherence to the protocol rules) and non-binding (possible renegotiation afterwards). They compared the procedures performance in terms of efficiency, envy-freeness, equitability and truthfulness. Their conclusions are: (a) The sophisticated mechanisms are advantageous only in the binding case; when renegotiation is possible, their performance drops to the baseline level of DC. (b) The preference for a procedure depends not only on the expected utility calculations of the negotiators, but also on their psychological profile: the more "antisocial" a person is, the more likely he is to opt for a procedure with a compensatory mechanism. The more risk-averse a person is, the more likely he is to opt for a straightforward procedure like DC. (c) The final payoff of a participant in a procedure depends a lot on the implementation. If participants cannot divide the goods under a procedure of their own choice, they are more eager to maximize their payoff. A shortened time horizon is equally detrimental. [22]

2. Structured procedures vs. Genetic algorithms. Two pairs of players had to divide between them 10 indivisible goods. A genetic algorithm was used to search for the best division candidates: out of the 1024 possible divisions, a subset of 20 divisions was shown to the players, and they were asked to grade their satisfaction about the candidate division on a scale ranging from 0 (not satisfied at all) to 1 (fully satisfied). Then, for each subject, a new population of 20 divisions was created using a genetic algorithm. This procedure continued for 15 iterations until a best surviving allocation was found. The results were compared to five provably-fair division algorithms: Sealed Bid Knaster, Adjusted Winner, Adjusted Knaster, Division by Lottery and Descending Demand. Often, the best divisions found by the genetic algorithm were rated as more mutually satisfactory than the ones derived from the algorithms. Two possible reasons for that were: (a) Temporal fluctuation of preferences - the valuations of humans change from the point they report their valuations to the point they see the final allocation. Most fair division procedures ignore this issue, but the genetic algorithm captures it naturally. (b) Non-additivity of preferences. Most division procedures assume that valuations are additive, but in reality they are not; the genetic algorithm works just as well with non-additive valuations. [23]

3. Simple procedures vs. Strongly-fair procedures. 39 player-pairs were given 6 indivisible gift-certificates of the same value ($10) but from different vendors (e.g. Esso, Starbucks, etc.). Before the procedure, each participant was shown all the 64 possible allocations, and was asked to grade the satisfaction and fairness of each of them between 0 (bad) and 100 (good). Then, they were taught seven different procedures, with different levels of fairness guarantees: Strict Alternation and Balanced Alternation (no guarantees), Divide and Choose (only envy-freeness), Compensation Procedure and Price Procedure (envy-freeness and Pareto-efficiency), Adjusted Knaster and Adjusted Winner (envy-freeness, Pareto-efficiency and equitability). They practiced each of these against a computer. Then, they did an actual division against another human subject. After the procedure, they were asked again to grade the satisfaction and fairness of the outcome; the goal was to distinguish procedural fairness from distributional fairness. The results showed that: (a) procedural fairness had no significant impact; satisfaction was mainly determined by distributional fairness. (b) the results of simpler procedures (strict alternation, balanced alternation and DC) were considered fairer and more satisfactory. They explain this couter-intuitive result by showing that humans care about object equality - giving each agent the same number of objects (though this does not entail any mathematical fairness criterion). [24]

Efficiency vs. strategy

Consider two agents that have to bargain on a deal, such as how to divide goods among them. Often, if they sincerely reveal their preferences, they can attain a win-win deal. However, if they strategically misrepresent their preferences in an attempt to gain, they might actually lose the deal. What negotiation procedure is most efficient in terms of attaining good deals? Several bargaining procedures were studied in the lab.

1. Sealed bid auction : a simple one-shot negotiation procedure. In the lab, information-advantaged players aggressively exploited asymmetric information, and drastically misrepresented their true valuation through strategic bidding. This often resulted in a reduced bargaining zone, forgone deals and low economic efficiency. In one experiment, deals were made on only 52% of all trials, while 77% of all trials had a positive bargaining zone. [25]

2. Bonus procedure: a procedure that gives a bonus was given to participants making a deal. This bonus is calculated such that it is optimal for players to reveal their true preferences. Lab experiments show that this does not help: subjects still strategize, although it is bad for them. [26]

3. Adjusted Winner (AW): a procedure that allocates divisible objects in order to maximize the total utility. In the lab, subjects bargained in pairs over two divisible objects. Each of the two objects was assigned a random value drawn from a commonly known prior distribution. Each player had complete information about their own values, but incomplete information about their co-bargainer’s values. There were three information conditions: (1) Competing Preferences: Players know that the preferences of their co-bargainer are similar to their own; (2) Complementary Preferences: Players know that the preferences of their co-bargainer are diametrically opposed to their own; (3) Unknown (Random) Preferences: Players do not know what their co-bargainer values most relative to their own preferences. In condition (1), the bilateral decisions converge toward efficient outcomes, yet only one-third are "envy-free". In condition (2), while players dramatically misrepresent their true valuation for objects, both efficiency and envy-freeness approach maximum levels. In condition (3), pronounced strategic bidding emerges, yet the result is twice as many envy-free outcomes, with increased levels of efficiency (relative to condition 1). In all cases, the structured AW procedure was quite successful in attaining a win-win solution - about 3/2 times more than unstructured negotiation. The key to its success is that it forces players out of the ‘fixed pie myth’. [27]

4. Conflict-resolution algorithm: Hortala-Vallve and lorente-Saguer describe a simple mechanism for solving several issues simultaneously (analogous to Adjusted Winner). They observe that equilibrium play increases over time, and truthful play decreases over time - agents manipulate more often when they learn their partners' preferences. Fortunately, the deviations from equilibrium do not cause much damage to the social welfare - the final welfare is close to the theoretic optimum. [28]

5. Fair cake-cutting algorithms: Ortega, Kyropoulou and Segal-Halevi [29] tested algorithms such as Divide and choose, Last diminisher, Even–Paz and Selfridge–Conway between laboratory subjects. It is known that these procedures are not strategyproof, and indeed, they found that subjects often manipulate them. Moreover, the manipulation was often irrational - subjects often used dominated strategies. Despite the manipulations, the algorithms for envy-free cake-cutting produced outcomes with less envy, and were considered fairer.

Children

In the lab, children were paired to "rich" and "poor" and were asked to share objects. There were differences in the perception of "initial belongings" vs. "things that have to be shared": young children (up to 7) did not distinguish them while older children (above 11) did. [30]

See also

Related Research Articles

Fair division is the problem in game theory of dividing a set of resources among several people who have an entitlement to them so that each person receives their due share. That problem arises in various real-world settings such as division of inheritance, partnership dissolutions, divorce settlements, electronic frequency allocation, airport traffic management, and exploitation of Earth observation satellites. It is an active research area in mathematics, economics, dispute resolution, etc. The central tenet of fair division is that such a division should be performed by the players themselves, maybe using a mediator but certainly not an arbiter as only the players really know how they value the goods.

Adjusted Winner (AW) is a procedure for envy-free item allocation. Given two agents and some goods, it returns a partition of the goods between the two agents with the following properties:

  1. Envy-freeness: Each agent believes that his share of the goods is at least as good as the other share;
  2. Equitability: The "relative happiness levels" of both agents from their shares are equal;
  3. Pareto-optimality: no other allocation is better for one agent and at least as good for the other agent;
  4. At most one good has to be shared between the agents.

Entitlement in fair division describes that proportion of the resources or goods to be divided that a player can expect to receive. In many fair division settings, all agents have equal entitlements, which means that each agent is entitled to 1/n of the resource. But there are practical settings in which agents have different entitlements. Some examples are:

<span class="mw-page-title-main">Fair cake-cutting</span> Fair division problem

Fair cake-cutting is a kind of fair division problem. The problem involves a heterogeneous resource, such as a cake with different toppings, 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. The division should be unanimously fair – each person should receive a piece believed to be a fair share.

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:

The fair pie-cutting problem is a variation of the fair cake-cutting problem, in which the resource to be divided is circular.

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:

Envy-freeness, also known as no-envy, is a criterion for fair division. It says that, when resources are allocated among people with equal rights, each person should receive a share that is, in their eyes, at least as good as the share received by any other agent. In other words, no person should feel envy.

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.

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.

Approximate Competitive Equilibrium from Equal Incomes (A-CEEI) is a procedure for fair item assignment. It was developed by Eric Budish.

Truthful cake-cutting is the study of algorithms for fair cake-cutting that are also truthful mechanisms, i.e., they incentivize the participants to reveal their true valuations to the various parts of the cake.

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.

In economics and computer science, Fractional Pareto efficiency or Fractional Pareto optimality (fPO) is a variant of Pareto efficiency used in the setting of fair allocation of discrete objects. An allocation of objects is called discrete if each item is wholly allocated to a single agent; it is called fractional if some objects are split among two or more agents. A discrete allocation is called Pareto-efficient (PO) if it is not Pareto-dominated by any discrete allocation; it is called fractionally Pareto-efficient (fPO) if it is not Pareto-dominated by any discrete or fractional allocation. So fPO is a stronger requirement than PO: every fPO allocation is PO, but not every PO allocation is fPO.

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:

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.

Fair division among groups is a class of fair division problems, in which the resources are allocated among groups of agents, rather than among individual agents. After the division, all members in each group consume the same share, but they may have different preferences; therefore, different members in the same group might disagree on whether the allocation is fair or not. Some examples of group fair division settings are:

Fair allocation of items and money is a class of fair item allocation problems in which, during the allocation process, it is possible to give or take money from some of the participants. Without money, it may be impossible to allocate indivisible items fairly. For example, if there is one item and two people, and the item must be given entirely to one of them, the allocation will be unfair towards the other one. Monetary payments make it possible to attain fairness, as explained below.

References

  1. 1 2 Flood, Merrill M. (1958-10-01). "Some Experimental Games". Management Science. 5 (1): 5–26. doi:10.1287/mnsc.5.1.5. ISSN   0025-1909.
  2. ↑ Pratt, John Winsor; Zeckhauser, Richard Jay (1990). "The Fair and Efficient Division of the Winsor Family Silver". Management Science. 36 (11): 1293–1301. doi:10.1287/mnsc.36.11.1293. ISSN   0025-1909.
  3. 1 2 Kurokawa, David; Procaccia, Ariel D.; Shah, Nisarg (2015-06-15). "Leximin Allocations in the Real World". Proceedings of the Sixteenth ACM Conference on Economics and Computation. ACM. pp. 345–362. doi:10.1145/2764468.2764490. ISBN   9781450334105. S2CID   1060279.
  4. ↑ Brams, Steven J.; Togman, Jeffrey M. (1996). "Camp David: Was The Agreement Fair?". Conflict Management and Peace Science. 15 (1): 99–112. doi:10.1177/073889429601500105. ISSN   0738-8942. S2CID   154854128.
  5. ↑ Massoud, Tansa George (2000-06-01). "Fair Division, Adjusted Winner Procedure (AW), and the Israeli-Palestinian Conflict". Journal of Conflict Resolution. 44 (3): 333–358. doi:10.1177/0022002700044003003. ISSN   0022-0027. S2CID   154593488.
  6. ↑ Denoon, D. B. H.; Brams, S. J. (1997-02-01). "Fair Division: A New Approach to the Spratly Islands Controversy". International Negotiation. 2 (2): 303–329. doi:10.1163/15718069720847997. ISSN   1571-8069.
  7. ↑ Goldman, Jonathan; Procaccia, Ariel D. (2015-01-28). "Spliddit: unleashing fair division algorithms". ACM SIGecom Exchanges. 13 (2): 41–46. doi:10.1145/2728732.2728738. S2CID   14135593.
  8. ↑ Gal, Ya'akov (Kobi); Mash, Moshe; Procaccia, Ariel D.; Zick, Yair (2016-07-21). "Which is the Fairest (Rent Division) of Them All?". Proceedings of the 2016 ACM Conference on Economics and Computation. ACM. pp. 67–84. doi:10.1145/2940716.2940724. ISBN   9781450339360. S2CID   53223944.
  9. ↑ Tijs, Stef H.; Branzei, Rodica (2004). "Cases in Cooperation and Cutting the Cake". SSRN   627424.
  10. ↑ Oluwasuji, Olabambo I.; Malik, Obaid; Zhang, Jie; Ramchurn, Sarvapali D. (2018). "Algorithms to Manage Load Shedding Events in Developing Countries". Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems: 2034–2036.{{cite journal}}: Cite journal requires |journal= (help)
  11. ↑ Walsh, Toby (2011), "Online Cake Cutting", Algorithmic Decision Theory, Lecture Notes in Computer Science, vol. 6992, Springer Berlin Heidelberg, pp. 292–305, doi:10.1007/978-3-642-24873-3_22, ISBN   9783642248726, S2CID   501890
  12. ↑ Shtechman, Itay; Gonen, Rica; Segal-Halevi, Erel (2020-05-05), "Fair Cake-Cutting Algorithms with Real Land-Value Data", Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, pp. 2005–2007, ISBN   978-1-4503-7518-4 , retrieved 2021-02-04
  13. ↑ Cavallo, Ruggiero (2012-07-22). "Fairness and welfare through redistribution when utility is transferable": 1306–1312.{{cite journal}}: Cite journal requires |journal= (help)
  14. ↑ Dickerson, John P.; Goldman, Jonathan; Karp, Jeremy; Procaccia, Ariel D.; Sandholm, Tuomas (2014-07-27). "The computational rise and fall of fairness": 1405–1411.{{cite journal}}: Cite journal requires |journal= (help)
  15. ↑ Segal-Halevi, Erel; Aziz, Haris; Hassidim, Avinatan (2017-08-19). "Fair Allocation based on Diminishing Differences". Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. AAAI Press. pp. 1254–1261. doi:10.24963/ijcai.2017/174. ISBN   9780999241103. S2CID   2504915.
  16. ↑ Konow, James (December 2003). "Which Is the Fairest One of All? A Positive Analysis of Justice Theories". Journal of Economic Literature. 41 (4): 1188–1239. doi:10.1257/002205103771800013. ISSN   0022-0515.
  17. ↑ Engelmann, Dirk; Strobel, Martin (2004-08-01). "Inequality Aversion, Efficiency, and Maximin Preferences in Simple Distribution Experiments". American Economic Review. 94 (4): 857–869. CiteSeerX   10.1.1.310.3267 . doi:10.1257/0002828042002741. ISSN   0002-8282.
  18. ↑ Fehr, Ernst; Naef, Michael; Schmidt, Klaus M (2006-11-01). "Inequality Aversion, Efficiency, and Maximin Preferences in Simple Distribution Experiments: Comment". American Economic Review. 96 (5): 1912–1917. CiteSeerX   10.1.1.163.1204 . doi:10.1257/aer.96.5.1912. ISSN   0002-8282.
  19. ↑ Herreiner, Dorothea; Puppe, Clemens (January 2007). "Distributing Indivisible Goods Fairly: Evidence from a Questionnaire Study". Loyola Marimount University - Economics Faculty Works.
  20. ↑ Herreiner DK, Puppe C (November 2010). "Inequality aversion and efficiency with ordinal and cardinal social preferences—An experimental study". Journal of Economic Behavior & Organization. 76 (2): 238–253. doi:10.1016/j.jebo.2010.06.002.
  21. ↑ Herreiner, Dorothea K.; Puppe, Clemens D. (2007). "Envy Freeness in Experimental Fair Division Problems". Theory and Decision. 67: 65–100. doi:10.1007/s11238-007-9069-8. hdl: 10419/22905 . S2CID   154799897.
  22. ↑ Schneider, Gerald; Krämer, Ulrike Sabrina (2004). "The Limitations of Fair Division: An Experimental Evaluation of Three Procedures". The Journal of Conflict Resolution. 48 (4): 506–524. doi:10.1177/0022002704266148. JSTOR   4149806. S2CID   18162264.
  23. ↑ Dupuis-Roy, Nicolas; Gosselin, Frédéric (2009). "An Empirical Evaluation of Fair-Division Algorithms" (PDF). Proceedings of the Annual Meeting of the Cognitive Science Society: 2681–2686.
  24. ↑ Dupuis-Roy, Nicolas; Gosselin, Frédéric (2011). "The Simpler, the Better: A New Challenge for Fair-Division Theory" (PDF). Proceedings of the Annual Meeting of the Cognitive Science Society (CogSci 2011): 3229–3234.
  25. ↑ T. E. Daniel, A. Seale, A. Rapoport (1998). "Strategic Play and Adaptive Learning in the Sealed Bid Bargaining Mechanism" (PDF). Journal of Mathematical Psychology. 42 (2–3): 133–166. doi:10.1006/jmps.1998.1220. PMID   9710545.{{cite journal}}: CS1 maint: multiple names: authors list (link)[ dead link ]
  26. ↑ Parco, James E.; Rapoport, Amnon (2004-11-01). "Enhancing Honesty in Bargaining Under Incomplete Information: An Experimental Study of the Bonus Procedure". Group Decision and Negotiation. 13 (6): 539–562. doi:10.1007/s10726-005-3824-4. ISSN   0926-2644. S2CID   96468159.
  27. ↑ Daniel, Terry E.; Parco, James E. (2005-05-01). "Fair, Efficient and Envy-Free Bargaining: An Experimental Test of the Brams-Taylor Adjusted Winner Mechanism". Group Decision and Negotiation. 14 (3): 241–264. doi:10.1007/s10726-005-1245-z. ISSN   0926-2644. S2CID   153519701.
  28. ↑ Hortala-Vallve, Rafael; Llorente-Saguer, Aniol (2010-11-01). "A simple mechanism for resolving conflict". Games and Economic Behavior. 70 (2): 375–391. CiteSeerX   10.1.1.508.8773 . doi:10.1016/j.geb.2010.02.005. ISSN   0899-8256. S2CID   18938516.
  29. ↑ Kyropoulou, Maria; Ortega, Josué; Segal-Halevi, Erel (2019-06-17). "Fair Cake-Cutting in Practice". Proceedings of the 2019 ACM Conference on Economics and Computation (PDF). Phoenix, AZ, USA: Association for Computing Machinery. pp. 547–548. doi:10.1145/3328526.3329592. ISBN   978-1-4503-6792-9. S2CID   53041563.
  30. ↑ Moessinger, Pierre (1975). "Developmental study of fair division and property". European Journal of Social Psychology. 5 (3): 385–394. doi:10.1002/ejsp.2420050310. ISSN   0046-2772.
  31. ↑ Güth, Werner; Schmittberger, Rolf; Schwarze, Bernd (1982-12-01). "An experimental analysis of ultimatum bargaining" (PDF). Journal of Economic Behavior & Organization. 3 (4): 367–388. doi:10.1016/0167-2681(82)90011-7. ISSN   0167-2681.
  32. ↑ Gabay, Anthony S.; Radua, Joaquim; Kempton, Matthew J.; Mehta, Mitul A. (2014-11-01). "The Ultimatum Game and the brain: A meta-analysis of neuroimaging studies". Neuroscience & Biobehavioral Reviews. 47: 549–558. doi: 10.1016/j.neubiorev.2014.10.014 . ISSN   0149-7634. PMID   25454357.
  33. ↑ Awad, Edmond; Dsouza, Sohan; Kim, Richard; Schulz, Jonathan; Henrich, Joseph; Shariff, Azim; Bonnefon, Jean-François; Rahwan, Iyad (2018-10-24). "The Moral Machine experiment". Nature. 563 (7729): 59–64. Bibcode:2018Natur.563...59A. doi:10.1038/s41586-018-0637-6. hdl: 10871/39187 . ISSN   0028-0836. PMID   30356211. S2CID   53029241.
  34. ↑ Dickinson, David L.; Tiefenthaler, Jill (2002). "What Is Fair? Experimental Evidence". Southern Economic Journal. 69 (2): 414–428. doi:10.2307/1061680. JSTOR   1061680.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.