PP-2005-11: An Essay on Sabotage and Obstruction

PP-2005-11: van Benthem, Johan (2005) An Essay on Sabotage and Obstruction. [Report]

Preview	Text (Full Text) PP-2005-11.text.pdf Download (259kB) | Preview
	Text (Abstract) PP-2005-11.abstract.txt Download (584B)

Abstract

We investigate the complexity jump which occurs when an algorithm of
known complexity is turned into a game by adding an opposing
player. Our specific examples are reachability and circuit algorithms,
which now have a Demon trying to prevent successful completion. We get
a PSPACE upper bound by translating the problems into first-order
model checking tasks on finite models. Finally, we consider general
jumps in coalitional powers when we add players to a game.

Item Type:	Report
Report Nr:	PP-2005-11
Series Name:	Prepublication (PP) Series
Year:	2005
Uncontrolled Keywords:	algorithm; game; sabotage; complexity
Depositing User:	Johan van Benthem
Date Deposited:	12 Oct 2016 14:36
Last Modified:	12 Oct 2016 14:36
URI:	https://eprints.illc.uva.nl/id/eprint/156

Actions (login required)

View Item