Analyzing and Optimizing the Throughput of a ...RePEc
ideas.repec.org
von H Ackermann · · Zitiert von: 2 — Author. Listed: Heiner Ackermann. (Fraunhofer Institute for Industrial Mathematics ITWM). Sandy Heydrich. (Fraunhofer Institute for Industrial Mathematics ...
Decision Support for Material ProcurementRePEc
ideas.repec.org
von H Ackermann · · Zitiert von: 1 — Heiner Ackermann. (Fraunhofer ITWM) · Erik Diessel. (Fraunhofer ITWM) · Michael Helmling. (Fraunhofer ITWM) · Christoph Hertrich. (Fraunhofer ITWM) · Neil Jami. ( ...
Ex-Post Equilibrium Market RecommendationsSocial Science Research Network
papers.ssrn.com
von C Parker · · Zitiert von: 1 — Gumataw K Abebe , Jos Bijman , Annie Royer · Jason Acimovic , Chris Parker , David Drake , Karthik Balasubramanian · Heiner Ackermann , Heiko ...
A unified approach to congestion games and two-sided markets
dl.acm.org
von H Ackermann · · Zitiert von: 11 — Authors: · Heiner Ackermann. Department of Computer Science, RWTH Aachen, Germany. Department of Computer Science, RWTH Aachen, Germany · Paul W. Goldberg · Vahab ... › doi › abs
https://www.sciencedirect.com › pdfScienceDirect.comTheoretical Computer Science Pure Nash equilibria in player-specific ...
www.sciencedirect.com
von H Ackermann · · Zitiert von: 106 — [1] Heiner Ackermann, Heiko Röglin, Berthold Vöcking, On the impact of combinatorial structure on congestion games, in: Proceedings of the 47th Ann. IEEE ...
https://algo.cs.uni-frankfurt.de › ...PDFGoethe-Universität FrankfurtDistributed Algorithms for QoS Load Balancing
algo.cs.uni-frankfurt.de
von H Ackermann · Zitiert von: 46 — [1] Heiner Ackermann, Petra Berenbrink, Simon Fischer, and Martin Hoefer. Concurrent imitation dy- namics in congestion games. In Proc. 28th Symp ...
https://www.sciencedirect.com › piiScienceDirect.comDispatching for batch chemical processes using Monte-Carlo ...
www.sciencedirect.com
von H Ackermann · · Zitiert von: 1 — Heiner Ackermann ; Michael Helmling ; Stefan Hoeser ; Neele Leithäuser ; Miguel A. · Romero-Valle ...
Concurrent Imitation Dynamics in Congestion GamesGoethe-Universität Frankfurt
algo.cs.uni-frankfurt.de
von H Ackermann · Zitiert von: 29 — Heiner Ackermann, Heiko Röglin, and Berthold Vöcking. On the impact of combinato- rial structure on congestion games. J. ACM, 55(6), Clemens ...
A Unified Approach to Congestion Games and Two-Sided ...Springer
link.springer.com
von H Ackermann · · Zitiert von: 9 — Heiner Ackermann, Heiko Röglin & Berthold Vöcking. Department of Computer Science, University of Liverpool, U.K.. Paul W. Goldberg. Microsoft Research, Redmond ... von H Ackermann · · Zitiert von: 9 — Heiner Ackermann, Heiko Röglin & Berthold Vöcking. Department of Computer Science, University of Liverpool, U.K.. Paul W. Goldberg. Microsoft Research, Redmond ...
https://link.springer.com › chapterSpringerCombinatorial Auctions in Freight Logistics
link.springer.com
von H Ackermann · · Zitiert von: 38 — Heiner Ackermann,; Hendrik Ewe,; Herbert Kopfer & … Karl-Heinz Küfer. Show ... Heiner Ackermann, Hendrik Ewe & Karl-Heinz Küfer. Chair of Logistics ...
https://link.springer.com › chapterSpringerPure Nash Equilibria in Player-Specific and Weighted Congestion ...
link.springer.com
von H Ackermann · · Zitiert von: 67 — Heiner Ackermann, ... Authors and Affiliations. Department of Computer Science, RWTH Aachen, D , Aachen, Germany. Heiner Ackermann, Heiko Röglin & Berthold ...
A First Step Towards Analyzing the Convergence Time in ...Springer
link.springer.com
von H Ackermann · · Zitiert von: 3 — Author information. Authors and Affiliations. Department of Computer Science, RWTH Aachen, D Aachen, Germany. Heiner Ackermann. Authors. Heiner Ackermann.
Alle Infos zum Namen "Heiner Ackermann"
A Unified Approach to Congestion Games and Two-Sided ...Project Euclid
projecteuclid.org
von H Ackermann · · Zitiert von: 8 — ... Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking · DOWNLOAD PDF + SAVE TO MY LIBRARY. Internet Math. 5(4): (2008) ... von H Ackermann · · Zitiert von: 8 — ... Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking · DOWNLOAD PDF + SAVE TO MY LIBRARY. Internet Math. 5(4): (2008) ...
Complexity of Pure Nash Equilibria in Player-Specific ...Internet Mathematics
www.internetmathematicsjournal.com
von H Ackermann · · Zitiert von: 17 — By Heiner Ackermann, Alexander Skopalik. Network congestion games with player-specific delay functions do not possess pure Nash equilibria in general. von H Ackermann · · Zitiert von: 17 — By Heiner Ackermann, Alexander Skopalik. Network congestion games with player-specific delay functions do not possess pure Nash equilibria in general.
https://projecteuclid.org › issue-4Project EuclidComplexity of Pure Nash Equilibria in Player-Specific Network ...
projecteuclid.org
von H Ackermann · · Zitiert von: 17 — Heiner Ackermann. Alexander Skopalik. "Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games." Internet Math. 5 (4) ,
https://research.google › pubs › a-...Google ResearchA Unified Approach to Congestion Games and Two-Sided Markets
research.google
von H Ackermann · Zitiert von: 9 — A Unified Approach to Congestion Games and Two-Sided Markets. Heiner Ackermann. Paul W. Goldberg. Vahab S. Mirrokni. Heiko R{\. Berthold V{\. WINE(2007), pp
A Unified Approach to Congestion Games and Two-Sided ...Internet Mathematics journal
www.internetmathematicsjournal.com
von H Röglin · · Zitiert von: 7 — Heiko Röglin · Paul W. Goldberg · Heiner Ackermann · Vahab S. Mirrokni · Berthold Vöcking ...
sortiert nach Relevanz / Datum