CfP GI/Dagstuhl research seminar 2004

From: Berthold Voecking (berthold.voecking_at_uni-dortmund.de)
Date: 01/22/04


Date: 22 Jan 2004 11:41:58 -0800

The GI/Dagstuhl research seminar series primarily addresses graduate
students and recent PhDs that actively want to learn about new
developments. Please forward this CfP to suitable students and
PhDs in your department or at your institution.

*********************************************************************
                       Call for Participation
                     GI/Dagstuhl research seminar

              Game-Theoretic Analyses of the Internet

                     August 30th - September 3rd
                      Schloss Dagstuhl, Germany
           http://ls2-www.cs.uni-dortmund.de/gi-seminar/
*********************************************************************

The Internet is a platform for complex interaction between different
entities like network operators, service providers, and users.
Moreover, the network itself was not designed by a single person or
institution but emerged from the interaction of different entities.
Different players compete with each other but also build coalitions.
Todays rules and protocols for the interaction in the Internet assume
to a large extent that the participants behave nicely and follow the
protocols in a truthful manner in order to maximize the social
benefit. The entities operating the Internet, however, are driven by
economical interests, and many services that are free of costs today,
like forwarding data packets, might not be for free in the future,
since the incurred extra costs are not marginal. Under such
conditions, selfishness may prevail, and it seems quite reasonable to
assume that at least some entities rather try to manipulate and break
the protocols for their own benefit.

The socio-economic aspects described above constitute an interesting
challenge to derive and study new models for the Internet. In the past
few years, this challenge has received a lot of attention among
computer scientists. The applied tools and methods mostly come from
Algorithm and Game Theory but more and more also from Micro Economics.
An important field of research is the design of protocols, so-called
mechanisms, that take the selfish behavior of the participants into
account and "force" the participants to act truthfully. Other areas
include the comparison of scenarios in which users act selfishly with
globally optimal solutions. The goal of this seminar is to give a
comprehensive overview of the most important results in the areas of
selfish routing and mechanism design as well as to present other
models, ideas and concepts from Game Theory and Micro Economics that
might be relevant to studying the Internet. Topics of the seminar are

    * A. Mechanism Design
          o general principles
          o algorithmic mechanism design
          o distributed aspects
          o specific applications, e.g. multicast pricing
          o cost-sharing mechanisms
    * B. Auctions
          o combinatorial auctions
          o revenue maximizing auctions:
                + competitive auctions
                + optimal/approximate auction design
          o computational aspects of auctions
    * C. Games on Networks
          o congestion and crowding games
          o selfish routing in networks
          o Nash and Wardrop equilibria
          o coordination ratios (price of anarchy)
          o pricing network edges
          o network design with selfish agents
    * D. Algorithmic Aspects of Equilibria
          o complexity of general Nash equilibria
          o complexity of market equilibria
          o fast algorithms for specific games
          o games with incomplete information
          o evolutionary games

Organization:
The participants will be assigned a topic from the ones given above
together with relevant literature on this topic and prepare an
overview paper on the selected topic. During the seminar, this work is
presented and discussed. It is planned to collect the papers in a
seminar volume and publish it in an appropriate form. The seminar is
organized by

    * Markus Bl"aser, ETH Z"urich, Switzerland
    * Piotr Krysta, Universit"at Dortmund, Germany
    * R"udiger Reischuk, Universit"at zu L"ubeck, Germany
    * Berthold V"ocking, Universit"at Dortmund, Germany

Time and Location:
The seminar is organized as Dagstuhl-Seminar No. 04362, from August
30th to September 3rd, in the International Conference and Research
Center for Computer Science at Schloss Dagstuhl. Dagstuhl lies about
halfway between Saarbr"ucken and Trier. Registration fees will be 100
Euros, including accommodation and meals.

Application Modalities:
No preliminary knowledge of the seminar topic is required.
Participants are selected on the basis of a good general scientific
qualification. Participants can apply by sending a short curriculum
vitae and a letter of reference from a university professor.
Applications and questions should be sent by March 31st, 2004 to
gi-seminar@ls2.cs.uni-dortmund.de. An application should contain a
list of preferred areas (chosen from the list A,B,C,D above) ranked in
order of preference, e.g., BCDA. The topics together with related
literature will then be assigned by the organizing committee. The
applicants will be notified about the decision of the organizing
committee by the end of April, 2004.



Relevant Pages

  • Re: OT: Dropshipping
    ... This is not some internet thing I am getting into rather an in person ... seminar along with 200 other people at an upscale hotel conference ... the web hosting service. ... Everything else I am planning on doing ...
    (rec.gambling.poker)
  • Free web-based seminar on asteroids
    ... asteroids using the internet as a resource. ... the seminar here by joining this group. ... be provided links to allow internet access to the seminar. ...
    (uk.sci.astronomy)
  • Free web-based seminar on asteroids
    ... asteroids using the internet as a resource. ... the seminar here by joining this group. ... be provided links to allow internet access to the seminar. ...
    (sci.astro.amateur)