Fairly Distributing Undividable Goods: A Challenge

  • Context: Undergrad 
  • Thread starter Thread starter Gerenuk
  • Start date Start date
  • Tags Tags
    Challenge
Click For Summary
SUMMARY

The discussion focuses on developing a fair algorithm for distributing undividable goods among individuals with varying preferences and priorities. Participants emphasize the need for a method that maximizes satisfaction of individual preferences while considering past allocations. Suggested approaches include rating systems to evaluate choices and ensuring equitable distribution, particularly for those who did not receive goods in previous rounds. The document referenced, available at the University of Twente, provides foundational insights into distribution algorithms.

PREREQUISITES
  • Understanding of algorithm design principles
  • Familiarity with preference ranking systems
  • Knowledge of fairness criteria in resource allocation
  • Basic concepts of game theory related to cooperative strategies
NEXT STEPS
  • Research "Gale-Shapley algorithm for stable matching"
  • Explore "Knapsack problem algorithms for resource allocation"
  • Investigate "Fair division algorithms in game theory"
  • Study "Multi-criteria decision-making techniques"
USEFUL FOR

This discussion is beneficial for algorithm developers, game theorists, and anyone involved in resource allocation challenges, particularly in scenarios requiring fairness and consideration of individual preferences.

Gerenuk
Messages
1,027
Reaction score
5
Can you give me a suggestion how to find a reasonable algorithm do distribute undividable goods among different people? All of the people have different preferences, but might be clashing. Also some of them might have priorities, due to not getting anything last round.

So for one round there are objects A,B,C,... and many people how put down their individual preferences for them. Some of these people should be given a higher chance of getting one object (either in addition to the chance of getting others or just more security in getting one object at all).

A basic idea is of course to rate all choice and maximize the total number of ratings satisfied, but I don't know about details how to make this fair or clever.

Or can some suggest keywords or algorithms I should search for on the internet?
 
Physics news on Phys.org

Similar threads

Undergrad How to create a fair distribution algorithm?
  • · Replies 1 ·
Replies
1
Views
1K
Undergrad Fair distribution, minimizing envy
  • · Replies 2 ·
Replies
2
Views
2K
Undergrad Can chatgpt accurately calculate expected lengths in Pascal's triangle?
  • · Replies 66 ·
3
Replies
66
Views
8K
Undergrad How Does Money Redistribution Affect Poverty Levels in a Simulated Economy?
  • · Replies 28 ·
Replies
28
Views
3K
Undergrad Please Explain (actually explain) The Monty Hall Problem
  • · Replies 131 ·
5
Replies
131
Views
10K
Undergrad Finance: does the volatility of a stock follow a certain distribution?
  • · Replies 24 ·
Replies
24
Views
4K
Undergrad Adding random numbers: Tolerance analysis
  • · Replies 11 ·
Replies
11
Views
4K
Undergrad Ways to put n balls in m boxes such that exactly k boxes are empty?
  • · Replies 29 ·
Replies
29
Views
6K
Undergrad The statistics of 'psychic challenge'
  • · Replies 5 ·
Replies
5
Views
2K
Challenge: Find the minimum amount of draws possible for a list of integers
  • · Replies 9 ·
Replies
9
Views
3K