There's a difference between knowing the path and walking the path.
Dimitrios Kanoulas
[Δημήτρης Κανούλας]
email: dkan0u at ccs d0t neu d0t edu
[replace "0" with "o"]
Address:
College of Computer & Information Science
Northeastern University
360 Huntington Avenue,
West Village H, #202
Boston, MA 02115
Office: West Village H, #266
Phone: (617) 373-8340
I'm a theory graduate student in the College of Computer and Information Science at Northeastern University, advised by Prof. Rajmohan Rajaraman.
I did my undergraduate studies in the school of Computer Engineering and Informatics at University of Patras in Greece, advised by Prof. Paul Spirakis.
I'm interested in Algorithmic Game Theory, Approximation Algorithms and Combinatorial and Linear Optimization.
Education
Courses Taken as a Ph.D.
Professional Experience
- Northeastern University, Boston, MA, USA
- Teaching Assistant for the course: CSU390 Theory of Computation (undergraduate), Fall 2008.
- Teaching Assistant for the course: CSU390 Theory of Computation (undergraduate), Spring 2009.
- Research Assistant: Summer 2009, Fall 2009
Research Interests
I am a member of the Algorithms and Theory group at Northeastern University and my research interests lie in the largely field of Algorithms and Complexity.
In particular, my research right now lies in the theoretical field of Algorithmic Game Theory [Equilibria Complexity in both cooperative and non-cooperative games, Applications of A.G.T. in the Networks domain, and Mechanism Design and its applications in Combinatorial Auctions and Markets].
Other Interests:
- Approximation Algorithms and Complexity,
- Combinatorial and Linear Optimization,
- Design and Analysis of Algorithms,
- Pseudo-randomness {mainly focused on Cryptography).
Publications
-
"Performance evaluation of a descent algorithm for bi-matrix games",
Tsaknakis, Haralampos, Spirakis, Paul and Kanoulas, Dimitrios,
Short paper in WINE 2008, 2008, LNCS Proceedings.
[DK_P1]
Technical Reports
-
"Approximate Nash Equilibrium"
Conducting theoretical and experimental research on optimal algorithms
that can result in better approximate Nash Equilibria in bimatrices games.
Bachelor`s Thesis, University of Patras, Computer Engineering and Informatics Dept.
co-advisors: Paul Spirakis and Haralampos Tsakanakis, July 2008
-
"Performance evaluation of a descent algorithm for bi-matrix games",
Tsaknakis, Haralampos, Spirakis, Paul and Kanoulas, Dimitrios,
[Accepted as a short paper in WINE 2008], 2008.
[DK_TR1]
Research Group & Seminar
Algorithmic Game Theory Reading Group,
Northeastern University,
Fall 2008, Spring 2009.
Boston University - Northeastern Joint Theory of Computation Seminar,
Boston and Northeastern University,
Fall 2008, Spring 2009.
Seminar on Communications, Algorithms, Networking, and Security (SCANS),
Northeastern University,
Fall 2008, Fall 2009.
Northeastern PhdStudentSeminar,
Northeastern University,
Fall 2008, Spring 2009.
Resume
Here is my CV: [pdf] [ps]

blog: Par...Aloga
This
site was last updated on:
09/29/2008