by

Wikipedia Bot (@wikibot, 0)

Fair division protocols

Table of contents

Apportionment methods

AL procedure

Adjusted winner procedure

Approximate Competitive Equilibrium from Equal Incomes

Austin moving-knife procedures

Barbanel–Brams moving-knives procedure

Brams–Taylor procedure

Brams–Taylor–Zwicker procedure

Chore division

Decreasing Demand procedure

Divide and choose

Edmonds–Pruhs protocol

Envy-graph procedure

Envy minimization

Even–Paz protocol

Fair pie-cutting

Fink protocol

Hill–Beck land division problem

Last diminisher

Levmore–Cook moving-knives procedure

Lone divider

Partial allocation mechanism

Picking sequence

Proportional-fair scheduling

Proportional cake-cutting with different entitlements

Random priority item allocation

Rental harmony

Robertson–Webb envy-free cake-cutting algorithm

Robertson–Webb rotating-knife procedure

Round-robin item allocation

Selfridge–Conway procedure

Simmons–Su protocols

Simultaneous eating algorithm

Stromquist moving-knives procedure

Strongly proportional division

Surplus procedure

Truthful cake-cutting

Truthful resource allocation

Undercut procedure

Weighted fair queueing

 Ancestors (5)

View article source

Discussion (0)

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