activity
20112017
most citedThe Robust Price of Anarchy of Altruistic Games

27 citations · 34 across the 2 of their papers we have counts for

collaborators

6 papers

cs.GT2017

On Strong Equilibria and Improvement Dynamics in Network Creation Games

Tomasz Janus, Bart de Keijzer

We study strong equilibria in network creation games. These form a classical and well-studied class of games where a set of players form a network by buying edges to their neighbor…

cs.LO2017

An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space

John Fearnley, Sanjay Jain, Sven Schewe +2

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that…

cs.GT2013

Shapley Meets Shapley

Haris Aziz, Bart de Keijzer

This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions…

cs.CC2013★ 7 cited

The H-index can be easily manipulated

Bart de Keijzer, Krzysztof R. Apt

We prove two complexity results about the H-index concerned with the Google scholar merge operation on one's scientific articles. The results show that, although it is hard to merg…

cs.GT2013

On the Inefficiency of Standard Multi-Unit Auctions

Bart de Keijzer, Evangelos Markakis, Guido Schäfer +1

We study two standard multi-unit auction formats for allocating multiple units of a single good to multi-demand bidders. The first one is the Discriminatory Auction, which charges…

cs.GT2011★ 27 cited

The Robust Price of Anarchy of Altruistic Games

Po-An Chen, Bart de Keijzer, David Kempe +1

We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i's perceived cos…