Bart de Keijzer

According to our database1, Bart de Keijzer authored at least 29 papers between 2008 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Approximately Efficient Two-Sided Combinatorial Auctions.
ACM Trans. Economics and Comput., 2020

Obviously Strategyproof Single-Minded Combinatorial Auctions.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space.
Int. J. Softw. Tools Technol. Transf., 2019

The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing.
Math. Oper. Res., 2019

On Strong Equilibria and Improvement Dynamics in Network Creation Games.
Internet Math., 2019

Multi-Unit Bilateral Trade.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Facility Reallocation on the Line.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Sequential Posted-Price Mechanisms with Correlated Valuations.
ACM Trans. Economics and Comput., 2017

Coordination games on graphs.
Int. J. Game Theory, 2017

Fixed Price Approximability of the Optimal Gain from Trade.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Approximately Efficient Double Auctions with Strong Budget Balance.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

The Ground-Set-Cost Budgeted Maximum Coverage Problem.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

The Strong Price of Anarchy of Linear Bottleneck Congestion Games.
Theory Comput. Syst., 2015

Inefficiency of Games with Social Context.
Theory Comput. Syst., 2015

The Curse of Sequentiality in Routing Games.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Altruism and Its Impact on the Price of Anarchy.
ACM Trans. Economics and Comput., 2014

Finding Optimal Solutions for Voting Game Design Problems.
J. Artif. Intell. Res., 2014

Shapley meets Shapley.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

The H-index can be Easily Manipulated.
Bull. EATCS, 2013

Inefficiency of Standard Multi-unit Auctions.
Proceedings of the Algorithms - ESA 2013, 2013

Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration
CoRR, 2012

Finding Social Optima in Congestion Games with Positive Externalities.
Proceedings of the Algorithms - ESA 2012, 2012

Housing Markets with Indifferences: A Tale of Two Mechanisms.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

The Robust Price of Anarchy of Altruistic Games.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Complexity of coalition structure generation.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Enumeration and exact design of weighted voting games.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

Three New Complexity Results for Resource Allocation Problems
CoRR, 2008