1,356,197 research outputs found
The Christmas present polka [music] /
No full textFor piano.; Engraved.; Publication date from G. Skinner (2011), 'Toward a general history of Australian musical composition: first national music, 1788-c.1860', Sydney Conservatorium of Music, p. 488 http://trove.nla.gov.au/work/81022028; Also available online http://nla.gov.au/nla.mus-an10348866
Papers of Peter Howson, first accession
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/67385William Gibson legal material, correspondence, accounts 1881- 1938; Foy & Gibson Ltd. reports, correspondence, photographs, publications 1928-1956; Liberal Party of Australia correspondence 1949- 1951, campaign material (state and federal) 1948-1955; Communist Party Referendum material 1951; subject files 1947-1955; speeches 1949-1952.110195
Acquisition: [1984.0098] "Papers of Peter Howson, first accession
Learning gain: political expedient or meaningful measurement?
No full textThe political craving for simple measures of learning gain is neither pedagogically informed nor sufficiently nuanced. Alex Forsythe, Carol Evans, Camille Kandiko Howson and Corony Edwards argue that only by changing focus will the concept become usefu
Papers of Peter Howson
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/65760Records from the 1960s up to the 1980 Federal Election. There is material relating to Peter Howson's involvement in a number of state and federal committees of the Liberal Party, such as the State Executive, State Society, State and Federal Executive Philosophy Committee, Constitutional Committee, Immigration and Ethnic Affairs Committee, Pre-Selection Committee, Housing Sub-Committee, Transport Committee, Rural Committee, Population Committee. There are a number of boxes of correspondence. Also included are: The Landman’s Account Book and Diary, 1952; East Coast Sawmills Pty Ltd Purchase Journal July 1966-June 1970; The Liberal Way: A contemporary statement of Liberal Philosophy by C.J. Puplick and R.J. Southey.15392
Acquisition: [1993.0187] "Papers of Peter Howson
Howson groups which are not strongly Howson
No full textA group is called a Howson group if the intersection of any two finitely generated subgroups is again finitely generated, and called a strongly Howson group when a uniform bound for the rank of can be obtained from the ranks of and . Clearly, every strongly Howson group is a Howson group, but it is unclear in the literature whether the converse is true. In this note, we show that the converse is not true by constructing the first Howson groups which are not strongly Howson.6 pages. Comments are welcom
Imitation Games and Computation
No full textTAn imitation game is a finite two person normal form game in which the two players have the same set of pure strategies and the goal of the second player is to choose the same pure strategy as the first player. Gale et al. (1950) gave a way of passing from a given two person game to a symmetric game whose symmetric Nash equilibria are in oneto-one correspondence with the Nash equilibria of the given game. We give a way of passing from a given symmetric two person game to an imitation game whose Nash equilibria are in one-to-one correspondence with the symmetric Nash equilibria of the given symmetric game. Lemke (1965) portrayed the Lemke-Howson algorithm as a special case of the Lemke paths algorithm. Using imitation games, we show how Lemke paths may be obtained by projecting Lemke-Howson paths.
A simplicial algorithm approach to Nash equilibria in concave games
No full textHaake C-J, Su FE. A simplicial algorithm approach to Nash equilibria in concave games. Working Papers. Institute of Mathematical Economics. Vol 382. Bielefeld: Universität Bielefeld; 2006.In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of strategy profiles using a new variant of Sperner's Lemma for labelled triangulations of simplotopes, which we prove in this paper. Our algorithm uses a labelling derived from the satisficing function of Geanakoplos (2003) and can be used to compute approximate Nash equilibria for payoff functions that are not necessarily linear. Finally, in bimatrix games, we can compare our simplicial algorithm to the combinatorial algorithm proposed by Lemke & Howson (1964)
Letter from A. H. Woodward, Woodward Iron Company, Woodward, Alabama, to Howson and Howson, Washington, D. C., February 8, 1902
No full textThis item is from the Woodard Family Papers, an extensive collection , including business and personal correspondence, financial records, photographs, and other materials of this Birmingham, Alabama family which operated the Woodward Iron Company
Susan Howson, Lionel Robbins
No full textSusan Howson expertly constructs a detailed scholarly biography of Lionel Robbins, the well-known midcentury British economist, from a wealth of source material: not just publications but also diaries, letters, lecture notes, marginalia, and ephemera. There is so much detail in 1161 pages that no reader can reasonably be expected to find every part of it fascinating, although Howson’s writing style is pleasant. The work is neither hagiographical nor critical, the author rarely passing judgmen..
A simplicial algorithm approach to Nash equilibria in concave games
No full textIn this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of strategy profiles using a new variant of Sperner's Lemma for labelled triangulations of simplotopes, which we prove in this paper. Our algorithm uses a labelling derived from the satisficing function of Geanakoplos (2003) and can be used to compute approximate Nash equilibria for payoff functions that are not necessarily linear. Finally, in bimatrix games, we can compare our simplicial algorithm to the combinatorial algorithm proposed by Lemke and Howson (1964).simplicial algorithm, Nash equilibria, strategy labelling
- …
