- Fields of mathematics
- >
- Game theory
- >
- Fair division
- >
- Fair item allocation

- Fields of mathematics
- >
- Recreational mathematics
- >
- Fair division
- >
- Fair item allocation

- Mathematical economics
- >
- Game theory
- >
- Fair division
- >
- Fair item allocation

Proportional item allocation

Proportional item allocation is a fair item allocation problem, in which the fairness criterion is proportionality - each agent should receive a bundle that they value at least as much as 1/n of the e

Agreeable subset

An agreeable subset is a subset of items that is considered, by all people in a certain group, to be at least as good as its complement. Finding a small agreeable subset is a problem in computational

Envy-free matching

In economics and social choice theory, an envy-free matching (EFM) is a matching between people to "things", which is envy-free in the sense that no person would like to switch his "thing" with that o

Fair allocation of items and money

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 mone

Rental harmony

Rental harmony is a kind of a fair division problem in which indivisible items and a fixed monetary cost have to be divided simultaneously. The housemates problem and room-assignment-rent-division are

Efficient approximately-fair item allocation

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 exa

House allocation problem

In economics and computer science, the house allocation problem is the problem of assigning objects to people with different preferences, such that each person receives exactly one object. The name "h

Course allocation

Course allocation is the problem of allocating seats in university courses among students. Many universities impose an upper bound on the number of students allowed to register to each course, in orde

Top trading cycle

Top trading cycle (TTC) is an algorithm for trading indivisible items without using money. It was developed by David Gale and published by Herbert Scarf and Lloyd Shapley.

Egalitarian item allocation

Egalitarian item allocation, also called max-min item allocation is a fair item allocation problem, in which the fairness criterion follows the egalitarian rule. The goal is to maximize the minimum va

Fair random assignment

Fair random assignment (also called probabilistic one-sided matching) is a kind of a fair division problem. In an assignment problem (also called house-allocation problem or one-sided matching), there

Envy-free item allocation

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

Fair item allocation

Fair item allocation is a kind of a fair division problem in which the items to divide are discrete rather than continuous. The items have to be divided among several partners who value them different

© 2023 Useful Links.