In security games, the solution concept commonly used is that of a Stackelberg equilibrium where the defender gets to commit to a mixed strategy. The motivation for this is that the attacker can repeatedly observe the defender’s actions and learn her distribution over actions, before acting himself. If the actions were not observable, Nash (or perhaps correlated) equilibrium would arguably be a...

Research on heuristic functions is all about estimating the length (or cost) of solution paths. But what if there is no such path? Many known heuristics have the ability to detect (some) unsolvable states, but that ability has always been treated as a by-product. No attempt has been made to design heuristics specifically for that purpose, where there is no need to preserve distances. As a case ...

A natural way to benefit from distribution is via asynchronous invocations to methods or services. Upon invocation, a request is enqueued at the destination side and the caller can continue its execution. But a question remains: “what if one wants to manipulate the result of an asynchronous invocation?” First-class futures provide a transparent and easy-to-program answer: a future acts as the p...

This paper examines the claim that patients in coma, vegetative state and minimally conscious state may in fact be conscious. The topic is of great importance for a number of reasons--not least ethical. As soon as we know a given creature has any experiences at all, our ethical attitude towards it changes completely. A number of recent experiments looking for signs of intact or partially intact...

We would like to arrive at a single coherent pair of credences in X and X. Perhaps we wish to use these to set our own credences; or perhaps we wish to publish them in a report of the WHO as the collective view of expert epidemiologists; or perhaps we wish to use them in a decision-making process to determine how medical research funding should be allocated in 2018. Given their expertise, we wo...

An injective map from the vertex set of a graph G—its order may not be finite—to the set of all natural numbers is called an arithmetic (a geometric) labeling of G if the map from the edge set which assigns to each edge the sum (product) of the numbers assigned to its ends by the former map, is injective and the range of the latter map forms an arithmetic (a geometric) progression. A graph is c...

Compounds of indicative conditionals present some puzzling phenomena. Perhaps most striking, some nested indicative conditionals are uninterpretable. Proponents of NTV hold that indicative conditionals do not have truth values, and they use this to explain why nested indicative conditionals are sometimes uninterpretable: the embedded conditional does not provide the truth conditions needed by t...

A new simple model is introduced for a liquid and an equation of state is derived based on this model and the statistical mechanical calculations. This equation of state works well for the non-polar and slightly polar liquids. The important conclusion that may be deduced from this equation of state is that if the reduced variables of state are chosen and defined appropriately, then, the pri...