VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

251-0425-00L 5 Credits
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

WEB Algorithms

WEB Algorithms (in English)

VVZ CR n/a

Last Updated: 2026-02-05 14:59:54

Abstract

The course discusses algorithmic issues related to the Web, employing interesting algorithmic and mathematical techniques for modeling and analyzing various Web related problems w.r.t. network structure (small world, hotlink assignment, page ranking), basics of game theory, selfish agents, auctions, distributed selfish packet routing and load balancing, and on-line control in some generality.

Objective

Understanding of the main algorithmic issues and techniques related to the WEB.

Content

The course discusses algorithmic issues related to the Web, with a focus on recent theoretical developments that employ interesting algorithmic and mathematical techniques for modeling and analyzing various Web related problems. The course does not aim to cover the full breadth of such developments, but rather to highlight some important algorithmic ideas that supposedly will remain useful for the next generation(s) Internet. The course first considers network structure related topics such as the impact of the Small World Phenomenon on routing in networks, the optimal placement of new hotlinks within a website, and PageRank and related rankings of web search results. Next, we discuss the basics of Game Theory to understand the actions and interactions of so-called selfish agents who pursue their own interest. As the Web lacks a central control, the concept of selfish agents is particularly interesting for modeling the behavior of Web users and programs. The course presents auction-like mechanisms and algorithms that "steer" the actions of selfish Web users into a certain desired equilibrium situation. Typical applications are the routing of data packets, or the balancing of a computational load among network attached processors. Further, the course considers on-line control and algorithms in a Web environment. In such an online setting, the future is unknown and decisions have to be taken based on the so far available knowledge.

Resources

Literature

current research papers

General Information

Language
English
Frequency
Yearly recurring

Examination

Type
session examination
Mode
oral 15 minutes

Course Components

Type Title Time & Place Hours
lecture WEB Algorithms (in English)
  • Tue 08:15-10:00 (CAB G 51)
2 h weekly
exercise WEB Algorithms (in English)
  • Wed 14:15-15:00 (CAB G 51)
1 h weekly

Offered In