A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
A planar point set S is an (i, t) set of ghost chimneys if there exist lines H0, H1, . . . , Ht-1 such that the orthogonal projection of S onto Hj consists of exactly i + j distin...
David Charlton, Erik D. Demaine, Martin L. Demaine...
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study t...
John Augustine, Ning Chen, Edith Elkind, Angelo Fa...