Difference between revisions of "SAGT 2008"
Jump to navigation
Jump to search
(modified through wikirestore by orapi) |
(modified through wikirestore by orapi) |
||
| Line 1: | Line 1: | ||
{{Event | {{Event | ||
| − | |||
| − | |||
| − | |||
| − | |||
|Field=Theory of computation | |Field=Theory of computation | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|has Proceedings Link=https://doi.org/10.1007/978-3-540-79309-0 | |has Proceedings Link=https://doi.org/10.1007/978-3-540-79309-0 | ||
|has Proceedings DOI=10.1007/978-3-540-79309-0 | |has Proceedings DOI=10.1007/978-3-540-79309-0 | ||
|has Recording Link=https://www.tib.eu/de/suchen/id/TIBKAT:562240624/Algorithmic-game-theory-first-international-symposium?cHash=51e20081849c7a299b96d69e7e7f91a4 | |has Recording Link=https://www.tib.eu/de/suchen/id/TIBKAT:562240624/Algorithmic-game-theory-first-international-symposium?cHash=51e20081849c7a299b96d69e7e7f91a4 | ||
|has Proceedings Bibliography=dblp.org/db/conf/sagt/sagt2008.html | |has Proceedings Bibliography=dblp.org/db/conf/sagt/sagt2008.html | ||
| − | |State=DE/NW}} | + | |Acronym=SAGT 2008 |
| + | |End date=2008/05/02 | ||
| + | |Series=SAGT | ||
| + | |Type =Conference | ||
| + | |Country=DE | ||
| + | |State=DE/NW | ||
| + | |City =DE/NW/Paderborn | ||
| + | |Start date=2008/04/30 | ||
| + | |Title=1st International Symposium on Algorithmic Game Theory | ||
| + | |Accepted papers=28 | ||
| + | |Submitted papers=60}} | ||
==Topics== | ==Topics== | ||
Revision as of 20:30, 3 November 2021
Event Rating
| median | worst |
|---|---|
|
|
List of all ratings can be found at SAGT 2008/rating
| SAGT 2008 | |
|---|---|
1st International Symposium on Algorithmic Game Theory
| |
| Event in series | SAGT |
| Dates | 2008/04/30 (iCal) - 2008/05/02 |
| Location | |
| Location: | DE/NW/Paderborn, DE/NW, DE |
| Papers: | Submitted 60 / Accepted 28 (46.7 %) |
| Table of Contents | |
Topics
- Solution Concepts in Game Theory
- Game Classes (e.g., Bimatrix, Potential, Bayesian)
- Exact and Approximate Computation of Equilibria
- Convergence and Learning in Games
- Complexity Classes in Game Theory
- Algorithmic Aspects of Fixed-Point Theorems
- Mechanisms, Incentives and Coalitions
- Cost-Sharing Algorithms and Analysis
- Computational Aspects of Market Equilibria
- Computational Problems in Economics, Finance, Decision Theory and Pricing
- Auction Algorithms and Analysis
- Price of Anarchy and its Relatives
- Representations of Games and their Complexity
- Economic Aspects of Distributed Computing and the Internet
- Network Formation on the Internet
- Congestion, Routing and Network Design Games
- Game-Theoretic Approaches to Networking Problems
- Byzantine Game Theory
Important Dates
Submission: November 12, 2007, 21:00 GMT / 9:00pm GMT
Notification: January 19, 2008
Camera Ready: February 9, 2008
Early Registration Deadline: March 31, 2008
Late Registration Deadline: April 25, 2008
Conference: April 30 _ May 2, 2008
Committees
Program Committee
- Petra Berenbrink, Simon Fraser University, Canada
- Xiaotie Deng, City University of Hong Kong, Hong Kong S.A.R.
- Amos Fiat, Tel Aviv University, Israel
- Dimitris Fotakis, University of the Aegean, Greece
- Nicole Immorlica, CWI, Netherlands
- Elias Koutsoupias, University of Athens, Greece
- Stefano Leonardi, Università di Roma, Italy
- Marios Mavronicolas, University of Cyprus, Cyprus
- Vladimir V. Mazalov, Russian Academy of Sciences, Russia
- Igal Milchtaich, Bar-Ilan University, Israel
- Dov Monderer, Technion, Israel
- Burkhard Monien ( CHAIR ), University of Paderborn, Germany
- Giuseppe Persiano, Università di Salerno, Italy
- Tim Roughgarden, Stanford University, USA
- Amin Saberi, Stanford University, USA
- Bill Sandholm, University of Wisconsin, USA
- Paul Spirakis, Computer Technology Institute, Greece
- Bernhard von Stengel, London School of Economics, UK
- Takashi Ui, Yokohama National University, Japan
- Vijay V. Vazirani, Georgia Institute of Technology, USA
- Berthold Vöcking, RWTH Aachen, Germany
- Peter Widmayer, ETH Zurich, Switzerland