1
0
0
(1 - 19 von 20
)
[ ] Convergence and Hardness of Strategic Schelling...
arxiv.org
Authors:Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, David Stangl.
Dynamical Systems authors/titles Dec (120 skipped)
arxiv.org
Authors: Bernd Kawald, Pascal Lenzner. Comments: 36 pages, 16 figures. To appear at SPAA'13. Subjects: Computer Science and Game Theory (cs.GT); Data ...
Approximation and the Principle of Minimum Differentiation
www.ifaamas.org
von M Feldotto · Zitiert von: 4 — Matthias Feldotto, Pascal Lenzner, Louise Molitor, and Alexander Skopalik From Hotelling to Load Balancing: Approximation and the Principle. › aamas2019 › pdfs
[ ] On Dynamics in Selfish Network Creation
arxiv.org
From: Pascal Lenzner [view email] [v1] Wed, 19 Dec :17:57 GMT (266kb,D) [v2] Tue, 28 May :56:08 GMT (468kb,D).
Es fehlt: karlsfeld b münchen
Improving Ranking Quality and Fairness in Swiss-System ...
real.mtak.hu
von P Führlich · · Zitiert von: 1 — PASCAL LENZNER, Hasso Plattner Institute, University of Potsdam, Germany. The International Chess Federation (FIDE) imposes a voluminous and complex set of ... › EC_version
[ ] Schelling Segregation with Strategic Agents
arxiv.org
Submission history. From: Pascal Lenzner [view email] [v1] Fri, 22 Jun :02:05 UTC (531 KB) [v2] Fri, 19 Oct :10:14 UTC (567 KB). Which authors ...
Preface of STACS Special Issue - Archive ouverte HAL
hal.archives-ouvertes.fr
von R Niedermeier · — vide Bil`o and Pascal Lenzner studies Nash equilibria and the price of anarchy in the classic sum model of Network Creation Games. These are motivated. › file › PrefaceSISt...
[ ] Network Creation Games: Think Global - Act Local
arxiv.org
Authors: Andreas Cord-Landwehr, Pascal Lenzner. (Submitted on 8 Jun 2015). Abstract: We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model ...
Chybí: karlsfeld b münchen
Program & Abstracts
gi.de
von J Lunch · Zitiert von: 4 — Pascal Lenzner. (Potsdam). 12:00 – 12:30 Approximation Schemes for Scheduling Jobs on. Identical and Uniform Machines. Klaus Jansen. › Dokumente › Program_73_WS
[ ] On Selfish Creation of Robust Networks
arxiv.org
Authors: Ankit Chauhan, Pascal Lenzner, Anna Melnichenko, Martin Münn. (Submitted on 7 Jul 2016). Abstract: Robustness is one of the key properties of nowadays networks. However, robustness cannot be simply enforced by design or regulation since many important networks, most prominently the Internet, are not ...
Social Distancing Network Creation - DROPS
drops.dagstuhl.de
von T Friedrich · · Zitiert von: 1 — Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, and Anna Melnichenko; licensed under Creative Commons License CC-BY › LIPIcs-ICALP
[ v1] Selfish Network Creation with Non-Uniform Edge Cost
arxiv.org
From: Pascal Lenzner [view email] [v1] Fri, 30 Jun :56:56 GMT (191kb,D). Which authors of this paper are endorsers? | Disable MathJax (What is ...
[ ] Equilibria and Convergence in Fire Sale Games
arxiv.org
von N Bertschinger · — Authors:Nils Bertschinger, Martin Hoefer, Simon Krogmann, Pascal Lenzner, Steffen Schuldenzucker, Lisa Wilhelmi. › cs
[ ] On the Tree Conjecture for the Network Creation Game
arxiv.org
Authors: Davide Bilò, Pascal Lenzner. (Submitted on 4 Oct (v1), last revised 5 Jan (this version, v2)). Abstract: Selfish Network Creation focuses on modeling real world networks from a game-theoretic point of view. One of the classic models by Fabrikant et al. [PODC'03] is the network creation game, where ...
[ v1] On Dynamics in Selfish Network Creation
arxiv.org
... CS Bibliography. listing | bibtex · Bernd Kawald · Pascal Lenzner ... From: Pascal Lenzner [view email] [v1] Wed, 19 Dec :17:57 GMT ...
[ ] Greedy Selfish Network Creation
arxiv.org
Authors: Pascal Lenzner. (Submitted on 30 Oct 2012). Abstract: We introduce and analyze greedy equilibria (GE) for the well-known model of ...
sortiert nach Relevanz / Datum