95 citations · 371 across the 68 of their papers we have counts for
71 papers
Nondeterminism and Guarded Commands
Krzysztof R. Apt, Ernst-Rüdiger Olderog
The purpose of this paper is to discuss the relevance of nondeterminism in computer science, with a special emphasis on Dijkstra's guarded commands language.
Iterated Elimination of Weakly Dominated Strategies in Well-Founded Games
Krzysztof R. Apt, Sunil Simon
Recently, in [K.R. Apt and S. Simon: Well-founded extensive games with perfect information, TARK21], we studied well-founded games, a natural extension of finite extensive games wi…
Characterization of incentive compatible single-parameter mechanisms revisited
Krzysztof R. Apt, Jan Heering
We reexamine the characterization of incentive compatible single-parameter mechanisms introduced in Archer & Tardos(2001). We argue that the claimed uniqueness result, called `Myer…
A tutorial for computer scientists on finite extensive games with perfect information
Krzysztof R. Apt, Sunil Simon
We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to t…
Well-Founded Extensive Games with Perfect Information
Krzysztof R. Apt, Sunil Simon
We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilib…
Edsger W. Dijkstra: a Commemoration
Krzysztof R. Apt, Tony Hoare
This article is a multiauthored portrait of Edsger Wybe Dijkstra that consists of testimonials written by several friends, colleagues, and students of his. It provides unique insig…