- Language
-
Englisch
- Identifier
-
991792580
- Series
-
Dagstuhl seminar proceedings 07261
Contributor
- URN
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
26.01.2023, 1:52 PM CET
Other Objects (12)
Fair division : Dagstuhl seminar 0726, June 24 - 29, 2007
Better ways to cut a cake : revisited
Divide and conquer : a proportional, minimal envy cake cutting procedure
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
Some recent results on pie cutting
Maximizing the minimum load for selfish agents
Methods for modelling software systems (MMOSS) : 06351 abstracts collection ; Dagstuhl seminar
Strong price of anarchy for machine load balancing
Fair division : Dagstuhl seminar 0726, June 24 - 29, 2007
Better ways to cut a cake : revisited
Divide and conquer : a proportional, minimal envy cake cutting procedure
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
Some recent results on pie cutting
Maximizing the minimum load for selfish agents
Methods for modelling software systems (MMOSS) : 06351 abstracts collection ; Dagstuhl seminar
Strong price of anarchy for machine load balancing
Fair division : Dagstuhl seminar 0726, June 24 - 29, 2007
Better ways to cut a cake : revisited
Divide and conquer : a proportional, minimal envy cake cutting procedure
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
Some recent results on pie cutting
Maximizing the minimum load for selfish agents
Methods for modelling software systems (MMOSS) : 06351 abstracts collection ; Dagstuhl seminar