Tim Oosterwijk

About

Currently I’m a tenured assistant professor at the Vrije Universiteit Amsterdam. My main research interests are approximation algorithms and combinatorial optimization, and in particular algorithmic game theory. Over the past years, I focused mostly on flows over time and optimal stopping problems. My research is fundamental in nature, but is driven by problems observed in practice that suffer from a lack of coordination or resource limitations.

Work

Vrije Universiteit Amsterdam

Netherlands

Vrije Universiteit Amsterdam
|

Assistant professor

Netherlands

→

Maastricht University
|

Assistant Professor

Netherlands

→

Max-Planck-Institut für Informatik
|

Postdoctoral Researcher

Germany

→

Universidad de Chile
|

Postdoctoral Researcher

Chile

→

Maastricht University
|

Lecturer

Netherlands

→

Maastricht University
|

Ph.D. Student

Netherlands

→

Education

Technische Universiteit Eindhoven
Netherlands

→

Master of Science

Technische Universiteit Eindhoven
Netherlands

→

Bachelor of Science

Publications

Competitive mechanisms for energy-efficient cloud computing

Published by

Theoretical Computer Science

Summary

journal-article

Competitive mechanisms for energy-efficient cloud computing

Published by

Theoretical Computer Science

Summary

journal-article

Exact and approximation algorithms for routing a convoy through a graph

Published by

Mathematical Programming

Summary

journal-article

Exact and approximation algorithms for routing a convoy through a graph

Published by

Mathematical Programming

Summary

journal-article

The Secretary Problem with Independent Sampling

Published by

Management Science

Summary

journal-article

The Secretary Problem with Independent Sampling

Published by

Management Science

Summary

journal-article

Complexity of Fixed Order Routing

Summary

book-chapter

Complexity of Fixed Order Routing

Published by

Approximation and Online Algorithms

Summary

conference-paper

Bicriteria Nash flows over time

Published by

Games and Economic Behavior

Summary

journal-article

Bicriteria Nash flows over time

Published by

Games and Economic Behavior

Summary

journal-article

Exact and Approximation Algorithms for Routing a Convoy Through a Graph

Published by

48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)

Summary

conference-paper

Bicriteria Nash Flows over Time

Published by

Web and Internet Economics

Summary

conference-paper

On the Price of Anarchy for Flows over Time

Published by

Mathematics of Operations Research

Summary

journal-article

On the Price of Anarchy for Flows over Time

Published by

Mathematics of Operations Research

Summary

journal-article

Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals

Published by

Mathematics of Operations Research

Summary

journal-article

Cyclic lot-sizing problems with sequencing costs

Published by

Journal of Scheduling

Summary

journal-article

Cyclic lot-sizing problems with sequencing costs

Published by

Journal of Scheduling

Summary

journal-article

The secretary problem with independent sampling

Published by

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)

Summary

conference-paper

A general framework for energy-efficient cloud computing mechanisms

Published by

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020

Summary

conference-paper

On the Price of Anarchy for flows over time

Published by

ACM EC 2019 - Proceedings of the 2019 ACM Conference on Economics and Computation

Summary

conference-paper

On the Price of Anarchy for flows over time

Published by

Proceedings of the 2019 ACM Conference on Economics and Computation - EC '19

Summary

conference-paper

Recent Developments in Prophet Inequalities

Published by

ACM SIGecom Exchanges

Summary

journal-article

Approximation Algorithms in Allocation, Scheduling and Pricing

Published by

Maastricht University

Summary

dissertation-thesis

Posted price mechanisms for a random stream of customers

Published by

EC 2017 - Proceedings of the 2017 ACM Conference on Economics and Computation

Summary

conference-paper

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds

Published by

Algorithmica

Summary

journal-article

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds

Published by

Algorithmica

Summary

journal-article

Approximating Vector Scheduling

Published by

Algorithmica

Summary

journal-article

A logarithmic approximation for polymatroid congestion games

Published by

Operations Research Letters

Summary

journal-article

A logarithmic approximation for polymatroid congestion games

Published by

Operations Research Letters

Summary

journal-article

High Multiplicity Scheduling with Switching Costs for few Products

Published by

Operations Research Proceedings 2014

Summary

journal-article

Tractable cases of (×, 2)-bounded parsimony haplotyping

Published by

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Summary

journal-article

Tractable Cases of <inline-formula><tex-math notation="LaTeX">$(*,2)$</tex-math><alternatives> <inline-graphic xlink:type="simple" xlink:href="oosterwijk-ieq1-2352031.gif"/></alternatives></inline-formula>-Bounded Parsimony Haplotyping

Published by

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Summary

journal-article

Tractable Cases of (*,2) -Bounded Parsimony Haplotyping

Published by

Computational Biology and Bioinformatics, IEEE/ACM Transactions on

Summary

journal-article

Appendix for Tractable Cases of (*,2)-Bounded Parsimony Haplotyping

Summary

other

Tim Oosterwijk