This work proposes a natural defender-attacker Stackelberg game on a network in which the defender wants to maximize the IGL level of the network and commits to protecting parts of thenetwork while having knowledge of the strength of an attacker that wants to weaken the network.Expand

An allocation model under ordinal preferences that is more general than the Shapley-Scarf housing market is formalized and a general class of algorithms that return any allocation that is individually rational and Pareto optimal with respect to the responsive set extension is identified.Expand

We present a polynomial-space algorithm that computes the number independent sets of any input graph in time $O(1.1387^n)$ for graphs with maximum degree 3 and in time $O(1.2355^n)$ for general… Expand

This work derandomizes this algorithm at the cost of increasing the running time by a subexponential factor in $n, and adapts it to the enumeration setting where the authors need to enumerate all subsets of the universe with property $\Phi$.Expand

A protocol for social navigation benchmarking that is realistic, scalable, and repeatable across runs and physical spaces and an in-situ metric for evaluating performance on these scenarios using questionnaires is proposed.Expand

A one sided error means that an algorithm’s input is incorrect only on true outputs, or false outputs but not both, and a false negative Monte Carlo algorithm is always correct when it returns false.Expand