These pages provide information about recent developments at or relevant to the ILLC. Please let us know if you have material that you would like to be added to the news pages, by using the online submission form. For minor updates to existing entries you can also email the news administrators directly. English submissions strongly preferred.
The calender view is not available on the mobile version of the website. You can view this information as a list.
You can also view this information as a list or iCalendar-feed, or import the embedded hCalendar metadata into your calendar-app.
| << July 2010 | ||||||
|---|---|---|---|---|---|---|
| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
|
1
|
2
|
3
|
||||
|
4
|
5
|
6
|
7
|
8
|
9
|
10
|
|
11
|
12
|
13
|
14
|
15
|
16
|
17
|
|
18
|
19
|
20
|
21
|
22
|
23
|
24
|
|
25
|
26
|
27
|
28
|
29
|
30
|
31
|
1 July 2010, C&O Seminar, Tobias Harks (TU Berlin, Germany)
We provide an axiomatic framework for the the well studied lexicographical improvement property and derive new results on the existence of strong Nash equilibria for a very general class of congestion games with bottleneck objectives. This includes extensions of classical load-based models, routing games with splittable demands, scheduling games with malleable jobs, and more. Furthermore, we discuss the computational complexity of computing pure Nash and strong equilibria in these games.
For more information, see k.r.apt at cwi.nl
1 July 2010, C&O Seminar, Vincenzo Bonifaci (MPI Informatics, Saarbrücken, Germany)
We survey some recent results concerning the design and analysis of algorithms that ensure the schedulability of real-time tasks. We consider the problem of analyzing and certifying the feasibility of a system of periodically or sporadically recurring real-time tasks with hard deadlines, that have to be scheduled on a platform composed of one or more identical processors. We provide lower and upper bounds on the complexity of exact feasibility testing, as well as approximate feasibility tests for both the periodic and the sporadic variant.
For more information, see k.r.apt at uva.nl
7 July 2010, Computational Linguistics Seminar, Federico Sangati
For more information and abstracts, see https://www.illc.uva.nl/LaCo/CLS/