177,881 research outputs found
Howson, H R, NX40491
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/393638Surname: HOWSON. Given Name(s) or Initials: H R. Military Service Number or Last Known Location: NX40491. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 34223.214652
Item: [2016.0049.25931] "Howson, H R, NX40491
Howson, R S, VX17960
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/393639Surname: HOWSON. Given Name(s) or Initials: R S. Military Service Number or Last Known Location: VX17960. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 4419.214654
Item: [2016.0049.25932] "Howson, R S, VX17960
Howson, W R, WX16981
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/393640Surname: HOWSON. Given Name(s) or Initials: W R. Military Service Number or Last Known Location: WX16981. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 33240.214656
Item: [2016.0049.25933] "Howson, W R, WX16981
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 Note on the Howson Property in Inverse Semigroups
No full textAn algebra has the Howson property if the intersection of any two finitely generated subalgebras is again finitely generated. A simple necessary and sufficient condition is given for the Howson property to hold on an inverse semigroup with finitely many idempotents. In addition, it is shown that any monogenic inverse semigroup has the Howson property
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)
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
Men/Masculinities: new directions in Australian theory and practice
No full textRichard Howson, Chris Beasley & Martha Augoustino
Homotopy Methods to Compute Equilibria in Game Theory
No full textThis paper presents a complete survey of the use of homotopy methods in game theory.Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by variousselection theories. We present all relevant techniques underlying homotopy algorithms.We give detailed expositions of the Lemke-Howson algorithm and the Van den Elzen-Talman algorithm to compute Nash equilibria in 2-person games, and the Herings-Vanden Elzen, Herings-Peeters, and McKelvey-Palfrey algorithms to compute Nash equilibriain general n-person games.operations research and management science;
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
