Bart de Keijzer

About me

I am a post-doctoral researcher at the Centrum Wiskunde & Informatica (CWI), working in the Networks and Optimization group. I am interested in many areas of theoretical computer science, especially algorithmic game theory, and more generally: algorithms and computational complexity theory. Previously, I was a postdoc in the Web Algorithmics and Data Mining lab of the Sapienza University of Rome, and before that I was a Ph.D. student at CWI (where I am also working currently), supervised by Guido Schäfer.


Contact me

I appreciate receiving e-mail, so send me something. My e-mail addresses are keijzer at cwi dot nl and bdekeijzer at gmail dot com. Just pick either one.

You can alternatively send regular mail or directly visit me at my office: Room M237, Science Park 123, 1098XG, Amsterdam, The Netherlands.

Papers

Note: I do not update this webpage very frequently. This webpage has last been updated on 16 january 2016. For the more recent publications it is actually wiser to view my DBLP-entry.

Note: The list below contains a lot of links to authors and papers. I do not check very regularly whether all these links are up to date, so they may not always work. Feel free to let me know in case a link does not work; then I will update it.

Note: The list below is ordered reverse-chronologically and covers all types of publications (i.e., conference papers, journal papers, technical reports, theses and maybe more).

2016

Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta: Approximately Efficient Double Auctions with Strong Budget Balance. Symposium on Discrete Algorithms (SODA) 2016. [extended preprint]

2015

José Correa, Bart de Keijzer, Jasper de Jong, Marc Uetz: The Curse of Sequentiality in Routing Games. Conference on Web and Internet Economics (WINE) 2015. [extended preprint]

Bart de Keijzer, Guido Schäfer, Orestis Telelis: The Strong Price of Anarchy of Linear Bottleneck Congestion Games. Theory of Computing Systems. [pdf] [bibtex]

Marek Adamczyk, Allan Borodin, Diodato Ferraioli, Bart de Keijzer, Stefano Leonardi: Sequential Posted Price Mechanisms with Correlated Valuations. Arxiv Technical Report. (Also accepted for WINE 2015.) [pdf] [bibtex]

2014

Bart de Keijzer: Cooperation and Externalities in Algorithmic Game Theory. Ph.D. thesis. [pdf] [bibtex] Note: My Ph.D. advisor is Guido Schäfer. The members of the thesis committee are Krzysztof R. Apt, Edith Elkind, Stefano Leonardi, Leen Stougie, and Éva Tardos. The thesis was defended at VU University on june 16, 2014.

Bart de Keijzer, Tomas B. Klos, Yingqian Zhang: Finding Optimal Solutions for Voting Game Design Problems. Journal of Artificial Intelligence Research. [pdf] [bibtex] This is a journal-article adaptation of my master's thesis.

Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer: Altruism and Its Impact on the Price of Anarchy. Transactions on Economics and Computation (TEAC). [pdf] [bibtex]

Bart de Keijzer, Haris Aziz: Shapley Meets Shapley. Symposium on Theoretical Aspects of Computer Science (STACS) 2014. [pdf] [bibtex] This is a conference paper based on the 2013 ArXiv technical report with the same name, listed below.

2013

Bart de Keijzer, Krzysztof R. Apt: The H-index can be Easily Manipulated. Bulletin of the EATCS. [pdf] [bibtex]

Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis: Inefficiency of Standard Multi-unit Auctions. European Symposium on Algorithms (ESA) 2013. [pdf] [bibtex] Note: The ArXiv report titled On the Inefficiency of Standard Multi-Unit Auctions that is also listed here is a more extensive version of this paper. I recommend you read that instead.

Aris Anagnostopoulos, Luca Becchetti, Bart de Keijzer, Guido Schäfer: Inefficiency of Games with Social Context. Symposium on Algorithmic Game Theory (SAGT) 2013. [pdf] [bibtex]

Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis: On the Inefficiency of Standard Multi-Unit Auctions. ArXiv technical report. [pdf] [bibtex]

Bart de Keijzer, Krzysztof R. Apt: The H-index can be Easily Manipulated. ArXiv technical report. [pdf] [bibtex] Note: This report is equivalent to the EATCS publication with the same title (listed above).

Haris Aziz, Bart de Keijzer: Shapley Meets Shapley. ArXiv technical report. [pdf] [bibtex]

2012

Haris Aziz, Bart de Keijzer: Housing Markets with Indifferences: A Tale of Two Mechanisms. Conference on Artificial Intelligence (AAAI) 2012. [pdf] [bibtex]

Bart de Keijzer, Guido Schäfer: Finding Social Optima in Congestion Games with Positive Externalities. European Symposium on Algorithms (ESA) 2012. [pdf] [bibtex]

Bart de Keijzer, Tomas B. Klos, Yingqian Zhang: Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration. ArXiv technical report. [pdf] [bibtex]

2011

Haris Aziz, Bart de Keijzer: Complexity of Coalition Structure Generation. ArXiv technical report. [pdf] [bibtex]

Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer: The Robust Price of Anarchy of Altruistic Games. ArXiv technical report. [pdf] [bibtex]

Haris Aziz, Bart de Keijzer: Complexity of Coalition Structure Generation. Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) 2011. [pdf] [bibtex]

Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer: The Robust Price of Anarchy of Altruistic Games. Workshop on Internet and Network Economics (WINE) 2011. [pdf] [bibtex] Note: The ArXiv report with the same name that is also listed here is a much more extensive version of this paper. I recommend you read that instead.

2010

Bart de Keijzer, Tomas Klos, Yingqian Zhang: Enumeration and exact design of weighted voting games. Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) 2010. [pdf] [bibtex] Note: This paper is basically a concise version of a part of the paper "Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration", listed above. I recommend you read that paper instead.

Bart de Keijzer, Guido Schäfer, Orestis Telelis: On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. Symposium on Algorithmic Game Theory (SAGT) 2010. [pdf] [bibtex]

2009

Bart de Keijzer: On the Design and Synthesis of Voting Games: Exact Solutions for the Inverse Problem. Master's thesis. [pdf] [bibtex] Note: My advisors for my master's thesis are Tomas Klos and Yingqian Zhang. I wrote my thesis in the Algorithmics group at Delft University of Technology. Another note: The paper "Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration" that is listed above contains all results of this thesis, is more concise, and presents everything in a better way. I recommend you read that instead.

Bart de Keijzer, Sylvain Bouveret, Tomas B. Klos, Yingqian Zhang: On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences. Conference on Algorithmic Decision Theory (ADT) 2009. [pdf] [bibtex]

Bart de Keijzer: A Survey on the Computation of Power Indices. Literature survey. [pdf] [bibtex]

2008

Bart de Keijzer: Three New Complexity Results for Resource Allocation Problems. ArXiv technical report. [pdf] [bibtex] Note: First paper ever. Possibly contains some typos. Many (but not all) of the results in this manuscript are discussed much more clearly in the paper "On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences" that is also listed (and downloadable) here. So reading that one instead of this one is recommended.

Personal

I like playing piano (classical music), practicing Nunchakudo, and playing games. I am a fan of avant-garde and experimental music (but also many other sorts of music). My favorite band is Koenjihyakkei. Besides piano, I used to play drums (in a band) and pan flute, but unfortunately I stopped doing that due to time constraints. I also used to study Japanese language and passed level 3 of the Japanese Language Proficiency Test.