Despite repeated calls for the use of “mixed methods” in comparative analysis, political scientists have few systematic guides for carrying out such work. This paper details a unified approach which joins intensive case-study analysis with statistical analysis. Not only are the advantages of each approach combined, but also there is a synergistic value to the nested research design: for example...

This paper examines how to construct subgame-perfect mixed-strategy equilibria in discounted repeated games with perfect monitoring. We introduce a relatively simple class of strategy profiles that are easy to compute and may give rise to a large set of equilibrium payoffs. These sets are called self-supporting sets, since the set itself provides the continuation payoffs that are required to su...

In this paper, we study pure peer-to-peer (henceforth abbreviated as P2P) and mixed (combined single-spacecraft and P2P) satellite refueling in circular orbit constellations comprised of multiple satellites. We consider the optimization of two conflicting objectives in the refueling problem and show that the cost function we choose to determine the optimal refueling schedule reflects a reasonab...

We provide a new interpretation of mixed strategy equilibria that incorporates both von Neumann and Morgenstern’s classical concealment role of mixing as well as the more recent Bayesian view originating with Harsanyi. For any two-person game, G, we consider an incomplete information game, IG; in which each player’s type is the probability he assigns to the event that his mixed strategy in G is...

The early error detection capabilities of syntaxdriven parsers are studied. The classes of weak precedence and simple mixed-strategy precedence parsers are chosen as the object of study. Very similar techniques could be used to obtain related results for other classes of syntax-driven parsers. We investigate whether the correct-prefix and the viable-prefix properties can be enforced within thes...

We provide a new interpretation of mixed strategy equilibria that incorporates both von Neumann and Morgenstern’s classical concealment role of mixing as well as the more recent Bayesian view originating with Harsanyi. For any two-person game, G, we consider an incomplete information game, IG; in which each player’s type is the probability he assigns to the event that his mixed strategy in G is...

In the present study, we experimentally tested the role of hand motor circuits in simple-arithmetic strategies. Educated adults solved simple additions (e.g., 8 + 3) or simple subtractions (e.g., 11 - 3) while they were required to retrieve the answer from long-term memory (e.g., knowing that 8 + 3 = 11), to transform the problem by making an intermediate step (e.g., 8 + 3 = 8 + 2 + 1 = 10 + 1 ...

It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain classes of CNF formulas (Sel-man et al. 1992). In this paper we demonstrate that the power of local search for satissability testing can be further enhanced by employing a new strategy, called \mixed random walk", for escaping from local minima. We present a detailed comparison of this ...

North, Malcolm; Stine, Peter; O’Hara, Kevin; Zielinski, William; Stephens, Scott. 2009. An ecosystem management strategy for Sierran mixed-conifer forests. Gen. Tech. Rep. PSW-GTR-220. Albany, CA: U.S. Department of Agriculture, Forest Service, Pacific Southwest Research Station. 49 p. Current Sierra Nevada forest management is often focused on strategically reducing fuels without an explicit s...

This paper considers whether Maynard Smith's concept of an evolutionarily stable strategy, or "ESS", can be used to predict long-run strategy frequencies in large populations whose members are randomly paired to play a game, and who adjust their strategies over time according to sensible learning rules. The existing results linking the ESS to stable equilibrium population strategy frequencies w...