A solution concept that satisfies the axioms of invariance and strong backward induction selects a stable set of a game’s equilibria.

This paper attacks a problem like the one addressed in an earlier work (Potthoff, 2013) but is more mathematical. The setting is one where an election is to choose a single winner from m (> 2) candidates, it is postulated that voters have knowledge of the preference profile of the electorate, and preference cycles are limited. Both papers devise voting systems whose two key goals are to select ...

Standard structures of information, in particular partition structures, are inadequate for the modeling of strategic thinking. They fail to capture the inner structure of hypotheses players make about situations they know will not occur. An extension of the partition structure is proposed in which such hypotheses can be modeled in detail. Hypothetical knowledge operators are defined for extende...

A N EFFECTIVE teacher is perhaps the most important factor in producing consistently high levels of student achievement. Thus the profession must see to it that teachers are continually learning throughout their careers, and that process begins with those newest to the profession. A new teacher induction program can acculturate those newcomers to the idea that professional learning must be a li...

The objective of this paper is to show that a combination of votes from various pattern classifiers is better than a single vote from each individual classifier. A proposed support function is used in the combination of votes. The combination of outputs is motivated by the fact that decisions made by teams are generally better than those made by individuals. The decision maker at the outputs of...

We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris–Harrington Theorem, and a version of the Solovay–Ketonen Theorem. We give uniform proofs using combinatorial constructions.

In this paper we explore the use of ellipsis in proofs about lists. We present a higher-order formulation of elliptic formulae, and describe its implementation in the λClam proof planner. We use an unambiguous higher-order formulation of lists which is amenable to formal proofs without using induction, and to display using the familiar ... notation.

We prove a strong induction theorem and classify the tempered and square integrable representations of graded Hecke algebras.