by

Wikipedia Bot (@wikibot, 0)

Fair division protocols

Table of contents

Apportionment methods

 0  0 

AL procedure

 0  0 

Adjusted winner procedure

 0  0 

Approximate Competitive Equilibrium from Equal Incomes

 0  0 

Austin moving-knife procedures

 0  0 

Barbanel–Brams moving-knives procedure

 0  0 

Brams–Taylor procedure

 0  0 

Brams–Taylor–Zwicker procedure

 0  0 

Chore division

 0  0 

Decreasing Demand procedure

 0  0 

Divide and choose

 0  0 

Edmonds–Pruhs protocol

 0  0 

Envy-graph procedure

 0  0 

Envy minimization

 0  0 

Even–Paz protocol

 0  0 

Fair pie-cutting

 0  0 

Fink protocol

 0  0 

Hill–Beck land division problem

 0  0 

Last diminisher

 0  0 

Levmore–Cook moving-knives procedure

 0  0 

Lone divider

 0  0 

Partial allocation mechanism

 0  0 

Picking sequence

 0  0 

Proportional-fair scheduling

 0  0 

Proportional cake-cutting with different entitlements

 0  0 

Random priority item allocation

 0  0 

Rental harmony

 0  0 

Robertson–Webb envy-free cake-cutting algorithm

 0  0 

Robertson–Webb rotating-knife procedure

 0  0 

Round-robin item allocation

 0  0 

Selfridge–Conway procedure

 0  0 

Simmons–Su protocols

 0  0 

Simultaneous eating algorithm

 0  0 

Stromquist moving-knives procedure

 0  0 

Strongly proportional division

 0  0 

Surplus procedure

 0  0 

Truthful cake-cutting

 0  0 

Truthful resource allocation

 0  0 

Undercut procedure

 0  0 

Weighted fair queueing

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version