TY - CHAP AU - Eke, Norbert Otto ID - 19460 T2 - Werner Fritsch/Johanna Fritsch: Das Meer rauscht und rauscht – bis es lauscht. Hörstück TI - Vorwort ER - TY - GEN AU - Eke, Norbert Otto ID - 19509 IS - H. 1/2 T2 - Germanistik TI - Stefan Hulfeld: Theatergeschichtsschreibung als kulturelle Praxis. Wie Wissen über Theater entsteht. Zürich: Chronos, 2007 VL - 49 ER - TY - GEN AU - Eke, Norbert Otto ID - 19510 IS - H. 1/2 T2 - Germanistik TI - Lisa Marie Küssner: Sprach-Bilder versus Theater-Bilder. Möglichkeiten eines szenischen Umgangs mit den „Bilderwelten“ von Werner Fritsch. Marburg: Tectum, 2006 VL - 49 ER - TY - GEN AU - Eke, Norbert Otto ID - 19512 IS - H. 1/2 T2 - Germanistik TI - Stefanie Watzka: Verborgene Vermittler. Ansätze zu einer Historie der Theateragenten und -verleger. Marburg: Tectum, 2006 VL - 49 ER - TY - GEN AU - Eke, Norbert Otto ID - 19517 T2 - Übersetzen im Vormärz. Hg. von Bernd Kortländer und Hans T. Siepe (Forum Vormärz Forschung. Jahrbuch 2007) TI - Olaf Briese: Angst in den Zeiten der Cholera. 4 Bde. Berlin: Akademie Verlag, 2003 ER - TY - THES AU - Schomaker, Gunnar ID - 19615 SN - 978-3-939350-78-1 TI - Distributed Resource Allocation and Management in Heterogeneous Networks VL - 259 ER - TY - CONF AU - Briest, Patrick ID - 19686 SN - 0302-9743 T2 - Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP) TI - Uniform Budgets and the Envy-Free Pricing Problem ER - TY - CONF AU - Briest, Patrick AU - Krysta, Piotr AU - Babaioff, Moshe ID - 19687 T2 - Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT) TI - On the Approximability of Combinatorial Exchange Problems ER - TY - GEN AB - We study the problem of computing approximate Nash equilibria (epsilon-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It is known from recent work that in the 2-player case, a 1/2-Nash equilibrium can be easily found, but in general one cannot achieve a smaller value of epsilon than 1/2. In this paper we extend those results to the k-player case, and find that epsilon = 1-1/k is feasible, but cannot be improved upon. We show how stronger results for the 2-player case may be used in order to slightly improve upon the epsilon = 1-1/k obtained in the k-player case. AU - Briest, Patrick AU - Goldberg, Paul W. AU - Roeglin, Heiko ID - 19688 TI - Approximate Equilibria in Games with Few Players ER - TY - CONF AU - Battré, Dominic AU - Hovestadt, Matthias AU - Kao, Odej AU - Keller, Axel AU - Voss, Kerstin ID - 1974 T2 - Proc. Int. Conf. on Risks and Security of Internet and Systems TI - Quality Assurance of Grid Service Provisioning by Risk Aware Managing of Resource Failures ER -