(mobo import Concept___Events_With_Academic_Fields-migrated) |
(mobo import Concept___Events-migrated) |
||
| Line 5: | Line 5: | ||
|Homepage=http://sagt2010.cti.gr/ | |Homepage=http://sagt2010.cti.gr/ | ||
|City=Athens | |City=Athens | ||
| − | |Country= | + | |Country=Country:GR |
|has Proceedings Link=http://dx.doi.org/10.1007/978-3-642-16170-4 | |has Proceedings Link=http://dx.doi.org/10.1007/978-3-642-16170-4 | ||
|has Proceedings DOI=10.1007/978-3-642-16170-4 | |has Proceedings DOI=10.1007/978-3-642-16170-4 | ||
| Line 18: | Line 18: | ||
|End Date=2010/10/20 | |End Date=2010/10/20 | ||
|Academic Field=Theory Of Computation | |Academic Field=Theory Of Computation | ||
| + | |Event Status=as scheduled | ||
| + | |Event Mode=on site | ||
}} | }} | ||
==Topics== | ==Topics== | ||
Revision as of 14:51, 6 September 2022
The document "SAGT 2010" was published on "2022-12-15T15:53:18" on the website "ConfIDent" under the URL https://confident-conference.org/index.php/Event:SAGT 2010.
The document "SAGT 2010" describes an event in the sense of a conference.
The document "SAGT 2010" contains information about the event "SAGT 2010" with start date "2010/10/18" and end date "2010/10/20".
The event "SAGT 2010" is part of the event series identified by [[Event Series:SAGT]]
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
- Computational Social Choice
Important Dates
Submission deadline: May 10, 2010, 23:59 GMT
Notification of authors: June 28, 2010
Camera ready submission: July 27, 2010
Symposium dates: October 18-20, 2010
Committees
Chairs:
- Elias Koutsoupias, National & Kapodistrian University of Athens, Greece
- Paul Spirakis, R.A. Computer Technology Institute, Greece
Program Committee Members:
- Itai Ashlagi, Harvard Business School, USA
- Xi Chen, University of Southern California, USA
- Xiaotie Deng, City University of Hong Kong, HONG KONG
- Kousha Etessami, University of Edinburgh, UK
- Michal Feldman, Hebrew University of Jerusalem, ISRAEL
- Dimitris Fotakis, National Technical University of Athens, GREECE
- Paul W. Goldberg, University of Liverpool, UK
- Rica Gonen, Yahoo! Research, USA
- Haim Kaplan, Tel Aviv University, ISRAEL
- David Kempe, University of Southern California, USA
- Spyros Kontogiannis, University of Ioannina, GREECE
- Annamaria Kovacs, Goethe University Frankfurt/Main, GERMANY
- Vangelis Markakis, Athens University of Economics and Business, GREECE
- Marios Mavronicolas, University of Cyprus, CYPRUS
- Aranyak Mehta, Google Research, USA
- Seffi Naor, Technion - Israel Institute of Technology, ISRAEL
- Maher User:Curator 84, Microsoft Research New England, USA
- Michael Schapira, Yale University and UC Berkeley, USA
- Bernhard von Stengel, London School of Economics and Political Science, UK
- Berthold Voecking, RWTH Aachen University, GERMANY
