CAGT Seminar: Orestis Telelis

Title: On Pure and (approximate) Strong Equilibria of Facility Location Games
Speaker: Orestis Telelis
Time: Tue Nov 4th 2008, 14:15-15:00
Location: Turing-014
Abstract:

We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed by a non-negative weight per agent). Agents...

---

[PL-Seminar] Talk: Olivier Danvy

Title: Towards compatible and interderivable semantic specifications for the
Scheme programming language, part II: reduction semantics and abstract
machines

Speaker: Olivier Danvy

Abstract:
We present a context-sensitive reduction semantics for a lambda-calculus
with explicit substitutions and store and we show that the functional
implementation of this small-step semantics mechanically...

---

MADALGO seminar, Deepak Ajwani, Aarhus University

Title: Incremental Topological Ordering

Speaker: Deepak Ajwani, Aarhus University, MADALGO

Abstract:
I will present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n^{2.75}) time, independent of the number of edges inserted. I will then show an average case analysis of incremental topological ordering...

---

DAIMI Friday Lecturer: Susanne Bødker

Transparency ? looking back at three decades of research

Since the early days of HCI, transparency has been a conceptual focus
and a concern for design - is it possible to make the computer go
away, be unnoticed to the human user? Should the computer be viewed as
a conversation partner or disappear just like we do not need to know
about car engines to drive a car? The mid-1980 brought...

---

CAGT Seminar: Daniel Andersson

Title: Deterministic Graphical Games Revisited
Speaker: Daniel Andersson
Time: Tue Nov 11th 2008, 14:15-15:00
Location: Turing-014
Abstract:

We revisit Washburn's deterministic graphical games, a natural generalization of the perfect information win/lose games commonly solved by retrograde analysis. We study the complexity of solving deterministic graphical games and obtain an almost-linear time...

---