Monografie
Divide and conquer : a proportional, minimal envy cake cutting procedure
- Sprache
-
Englisch
- Identifier
-
991708024
- Reihe
-
Dagstuhl seminar proceedings 07261
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:53 MEZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Better ways to cut a cake : revisited
Some recent results on pie cutting
Fair division : Dagstuhl seminar 0726, June 24 - 29, 2007
Fair division : 07261 abstracts collection ; Dagstuhl seminar
Approximating min-max k-clustering
A pie that can't be cut fairly
Envy free cake divisions cannot be found by finite protocols
Equilibria for two parallel links : the strong price of anarchy versus the price of anarchy
Efficient cost sharing with a cheap residual claimant
Maximizing the minimum load for selfish agents
Strong price of anarchy for machine load balancing
Proving bounds for real linear programs in Isabelle, HOL : (extended abstract)
Better ways to cut a cake : revisited
Some recent results on pie cutting
Fair division : Dagstuhl seminar 0726, June 24 - 29, 2007
Fair division : 07261 abstracts collection ; Dagstuhl seminar
Approximating min-max k-clustering
A pie that can't be cut fairly
Envy free cake divisions cannot be found by finite protocols
Equilibria for two parallel links : the strong price of anarchy versus the price of anarchy
Efficient cost sharing with a cheap residual claimant
Maximizing the minimum load for selfish agents
Strong price of anarchy for machine load balancing
Proving bounds for real linear programs in Isabelle, HOL : (extended abstract)
Better ways to cut a cake : revisited
Some recent results on pie cutting
Fair division : Dagstuhl seminar 0726, June 24 - 29, 2007
Fair division : 07261 abstracts collection ; Dagstuhl seminar
Approximating min-max k-clustering
A pie that can't be cut fairly
Envy free cake divisions cannot be found by finite protocols
Equilibria for two parallel links : the strong price of anarchy versus the price of anarchy
Efficient cost sharing with a cheap residual claimant
Maximizing the minimum load for selfish agents
Strong price of anarchy for machine load balancing