Abstract is missing.
- Maximizing the Minimum Load for Selfisch AgentsLeah Epstein, Rob van Stee. [doi]
- 07261 Abstracts Collection -- Fair DivisionSteven J. Brams, Kirk Pruhs. [doi]
- Envy-free cake divisions cannot be found by finite protocolsWalter Stromquist. [doi]
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting ProcedureSteven J. Brams, Michael A. Jones, Christian Klamler. [doi]
- Approximating min-max k-clusteringAsaf Levin. [doi]
- 06361 Executive Report -- Computing Media Languages for Space-Oriented ComputationAndré DeHon, Jean-Louis Giavitto, Frédéric Gruau. [doi]
- 07261 Summary -- Fair DivisionSteven J. Brams, Kirk Pruhs. [doi]
- Better Ways to Cut a Cake - RevisitedSteven J. Brams, Michael A. Jones, Christian Klamler. [doi]
- Strong Price of Anarchy for Machine Load BalancingAmos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky. [doi]
- Some Recent Results on Pie CuttingMichael A. Jones. [doi]
- Equilibria for two parallel links: The strong price of anarchy versus the price of anarchyLeah Epstein. [doi]
- Programming self developing blob machines for spatial computing.Frédéric Gruau, Christine Eisenbeis. [doi]
- 06361 Abstracts Collection -- Computing Media Languages for Space-Oriented ComputationAndré DeHon, Jean-Louis Giavitto, Frédéric Gruau. [doi]
- Efficient cost sharing with a cheap residual claimantHervé Moulin. [doi]
- A Pie That Can t Be Cut Fairly (revised for DSP)Walter Stromquist. [doi]
- Programming ManifoldsJacob Beal, Jonathan Bachrach. [doi]