Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, September 24, 2013, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Po-Shen Loh (Carnegie Mellon University)

The Internet has emerged as the most important network in modern computing, but miraculously, it was created through the individual actions of a multitude of agents rather than by a central authority. This motivates the game theoretic study of network formation, and we consider one of the best-studied models, due to Fabrikant et al. In it, each of n agents is a vertex, which creates edges to other vertices at a cost of α each. Every edge can be freely used by every agent, regardless of who paid the creation cost. To reflect the desire to be close to other vertices, each agent's cost function is further augmented by the sum of its (graph theoretic) distances to all other vertices.

Previous research proved that in many regimes of the (α,n) parameter space, every Nash equilibrium has total social cost (sum of all agents' costs) within a constant factor of the optimal social cost. In algorithmic game theory, this approximation ratio is called the price of anarchy. We significantly sharpen some of those results, proving that for all constant non-integral α>2, the price of anarchy is not only bounded by a constant, but tends to 1 as n\rightarrow\infty. For constant integral α>=2, we show that the price of anarchy is bounded away from 1.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login