(mobo import Concept___Events-migrated) |
Curator 20 (talk | contribs) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 5: | Line 5: | ||
|City=Paderborn | |City=Paderborn | ||
|Country=Country:DE | |Country=Country:DE | ||
| − | |||
| − | |||
|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=https://doi.org/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 | ||
| Line 23: | Line 21: | ||
}} | }} | ||
{{Event Deadline}} | {{Event Deadline}} | ||
| + | {{Event Metric | ||
| + | |Number Of Submitted Papers=60 | ||
| + | |Number Of Accepted Papers=28 | ||
| + | }} | ||
{{S Event}} | {{S Event}} | ||
==Topics== | ==Topics== | ||
Latest revision as of 15:53, 15 December 2022
The document "SAGT 2008" was published on "2022-12-15T15:53:02" on the website "ConfIDent" under the URL https://confident-conference.org/index.php/Event:SAGT 2008.
The document "SAGT 2008" describes an event in the sense of a conference.
The document "SAGT 2008" contains information about the event "SAGT 2008" with start date "2008/04/30" and end date "2008/05/02".
The event "SAGT 2008" is part of the event series identified by [[Event Series:SAGT]]
Deadlines
Metrics
Submitted Papers
60
Accepted Papers
28
Venue
Paderborn, Germany
Warning: Venue is missing. The map might not show the exact location.
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
