Welcome...

dr. J. de Jong MSc (Jasper)

Lecturer

Expertise

Price Of Anarchy
Nash Equilibrium
Approximation Algorithms
Scheduling
Throughput
Congestion Games
Cost Function
Affine Function

Organizations

Publications

Recent Articles
de Jong, J., Klimm, M., & Uetz, M. J. (2016). Efficiency of equilibria in uniform matroid congestion games. In M. Gairing, & R. Savani (Eds.), Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT 2016) (pp. 105-116). (Lecture Notes in Computer Science; Vol. 9928). Heidelberg: Springer Verlag. DOI: 10.1007/978-3-662-53354-3_9
de Jong, J., Klimm, M., & Uetz, M. J. (2016). Efficiency of equilibria in uniform matroid congestion games. (CTIT Technical Report Series; No. TR-CTIT-16-04). Enschede: University of Twente, Centre for Telematica and Information Technology (CTIT).
Correa, J., de Jong, J., de Keijzer, B., & Uetz, M. J. (2015). The curse of sequentiality in routing games. In E. Markakis, & G. Schäfer (Eds.), 11th International Conference on Web and Internet Economics, WINE 2015 (pp. 258-271). (Lecture Notes in Computer Science; Vol. 9470). Heidelberg: Springer Verlag. DOI: 10.1007/978-3-662-48995-6_19
Correa, J., de Jong, J., de Keijzer, B., & Uetz, M. J. (2015). The curse of sequentiality in routing games. (CTIT Technical Report Series; No. TR-CTIT-15-07). Enschede: University of Twente, Centre for Telematica and Information Technology (CTIT).
de Jong, J., & Uetz, M. J. (2014). The sequential price of anarchy for atomic congestion games. In T-Y. Liu, Q. Qi, & Y. Ye (Eds.), Proceedings of the 10th Conference on Web and Internet Economics, WINE 2014 (pp. 429-434). (Lecture Notes In Computer Science; Vol. 8877). Berlin: Springer International Publishing Switzerland. DOI: 10.1007/978-3-319-13129-0_35
de Jong, J., & Uetz, M. J. (2014). The sequential price of anarchy for atomic congestion games. (CTIT Technical Report Series; No. TR-CTIT-14-09). Enschede: Centre for Telematics and Information Technology University of Twente.
de Jong, J., Uetz, M. J., & Wombacher, A. (2013). Decentralized throughput scheduling. In P. G. Spirakis, & M. Serna (Eds.), 8th International Conference on Algorithms and Complexity, CIAC 2013 (pp. 134-145). (Lecture Notes in Computer Science; Vol. 7878). Berlin: Springer Verlag. DOI: 10.1007/978-3-642-38233-8_12
de Jong, J., Vinduška, H., Hans, E. W., & Post, G. F. (2012). Polymetrisch metselen. STAtOR, 13(1), 9-12.
de Jong, J., Uetz, M. J., & Wombacher, A. (2012). Decentralized Throughput Scheduling. (CTIT Technical Report Series; No. TR-CTIT-12-18). Enschede: Centre for Telematics and Information Technology University of Twente.

UT Research Information System

Contact Details

Visiting Address

University of Twente
Faculty of Electrical Engineering, Mathematics & Computer Science
Zilverling (building no. 11), room 4032
Hallenweg 19
7522NH  Enschede
The Netherlands

Navigate to location

Mailing Address

University of Twente
Faculty of Electrical Engineering, Mathematics & Computer Science
Zilverling  4032
P.O. Box 217
7500 AE Enschede
The Netherlands

Organizations