Courcoubetis A. Costas


Diploma of Electrical Engineer, National Technical University Athens, Greece

Master M.Sc. in Electrical Engineering and Computer Science, University of California, Berkeley

Ph.D. in Electrical Engineering and Computer Science, University of California, Berkeley



47 Euelpidon Str. & 33 Lefkados Str., 8th floor


courcou at


+30 210 8203 653

Office Hours: 


Research Interests: 


Pricing of network services. Pricing is considered as an important tool for improving performance and controlling congestion. Important issues include fairness in terms of resource usage, incentive compatibility of pricing schemes, and  the relation of pricing to actual resource usage

Basic research in resource allocation problems for broadband networks. Emphasis is given in developing approximation techniques based on large deviation asymptotics for the analysis of the performance of large networks and for the derivation of control rules for optimal resource allocation.

Formal methods for the specification and verification of concurrent systems with emphasis in systems with real-time and randomization: Development of efficient algorithms and tools for the verification of real-time systems such as computer communication protocols, asynchronous circuits, switching software. Real-time extensions of temporal logic and automata.
Other interests: Applied probability models and optimization, stochastic scheduling, network management.



 Ph.D. Dissertation: Conflict resolution among resource sharing processes.

Selected Publications: 

 C. Courcoubetis, P. Antoniadis, and R. Mason "Comparing Economic Incentives in Peer-to-Peer Networks", Special Issue on Network Economics, Computer Networks, Elsevier, 45(1):133-146, 2004.

C. Courcoubetis, P. Antoniadis, and B. Strulo, "Incentives for Content Availability in Memory-less Peer-to-Peer File Sharing Systems", ACM SIGecom Exchanges, 5(4):11-20, July 2005.

C. Courcoubetis and R. Weber, "Incentives for large peer-to-peer systems", in IEEE JSAC Special Issue on Price-Based Access Control and Economics of Networking, 2006.

P. Antoniadis, C. Courcoubetis and R. Weber, "An Asymptotically Optimal Scheme for P2P File Sharing", Proceedings of the Second Workshop on the Economics of Peer-to-Peer Systems, Harvard University, June 4-5 2004.

C. Courcoubetis and V.A. Siris, "Resource Control for Loss-Sensitive Traffic in CDMA Networks", in Proceedings of 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM), Hong Kong, March 7-11, 2004.

C. Courcoubetis and R. Weber, "Asymptotics for Provisioning Problems of Peering Wireless LANs with a Large Number of Participants". Proceedings of WiOpt' 04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Cambridge 2004.

C. Courcoubetis, A. Dimakis, and G.D. Stamoulis, "Traffic Equivalence and Substitution in a Multiplexer with Applications to Dynamic Call Admission Control", IEEE/ACM Transactions on Networking, April 2002, Vol. 10, no.2, pp 217-231.

C. Courcoubetis, F. P. Kelly, and R. Weber, "Measurement-based usage charges in communication networks". Operations Research, 48(4):535-548, July/August 2000.


 C. Courcoubetis and R. Weber, Pricing Communication Networks: Economics, Technology and Modeling, Wiley, 2003.

Selected Projects: 

 EuroNGI Network of Excellence: Theoretical issues about designing Next Generation Internet.

MMAPS: Economic models και developing peer-to-peer systems, 2002-2004.

M3I: Head of AUEB research team (Charging models and architectures for the Internet), 2000-2002.


Other Activities: 

 Member of the National Research Board (2002-2003), Member of the Administrative board of KTP S.A. (2003-2004).

Head of the Networks and Telecommunications Sector, Informatics Institute, ΙΤΕ (1990-1999). Forthnet was initially this sector's activity.

Administrator of the Economics and Systems Theory Laboratory, Athens University of Economics and Business (2000-present). 

Member of the Conference program Committee (2004, 2005): INFOCOM, ICQT, AP2PC, Networking2004, NGInetworks.