7 citations · 40 across the 14 of their papers we have counts for
16 papers
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…
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…
Boolean Observation Games
Hans van Ditmarsch, Sunil Simon
We introduce Boolean Observation Games, a subclass of multi-player finite strategic games with incomplete information and qualitative objectives. In Boolean observation games, each…
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…
Graphical One-Sided Markets
Sagar Massand, Sunil Simon
We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well…
Coordination Games on Weighted Directed Graphs
Krzysztof R. Apt, Sunil Simon, Dominik Wojtczak
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, au…