Receipt from M.Y. Keating, Books, Stationary and Newspapers, St. Catharines for books

Receipt from M.Y. Keating, Books, Stationary and Newspapers, St. Catharines for books, Dec. 23, 1887.

Great books

UANL

The books of the Bible

UANL

Cooperative VS. Non-cooperative Truels: Little Agreement, but Does that Matter?

It is well-known that non-cooperative and cooperative game theory may yield different solutions to games. These differences are particularly dramatic in the case of truels, or three-person duels, in which the players may fire sequentially or simultaneously, and the games may be one-round or n-round. Thus, it is never a Nash equilibrium for all players to hold their fire in any of these games, whereas in simultaneous one-round and n-round truels such cooperation, wherein everybody survives, is in both the a -core and ß -core. On the other hand, both cores may be empty, indicating a lack of stability, when the unique Nash equilibrium is one survivor. Conditions under which each approach seems most applicable are discussed. Although it might be desirable to subsume the two approaches within a unified framework, such unification seems unlikely since the two approaches are grounded in fundamentally different notions of stability.

Efficiency in Uncertain Cooperative Games

A contingent contract in a transferable utility game under uncertainty specifies an outcome for each possible state. It is assumed that coalitions evaluate these contracts by considering the minimal possible excesses. A main question of the paper concerns the existence and characterization of efficient contracts. It is shown that they exist if and only if the set of possible coalitions contains a balanced subset. Moreover, a characterization of values that result in efficient contracts in the case of minimally balanced collections is provided.

Analyse comparative des decisions d'emploi en incertitude de la cooperative de travailleurs et de la firme capitaliste traditionnelle a proprietaire unique.

Rapport de recherche

Books and reading; by Brother Azarias of the Brothers of the Christian schools

UANL

Cooperative of Noncooperative Behavior?

In an abstract two-agent model, we show that every deterministic joint choice function compatible with the hypothesis that agents act noncooperatively is also compatible with the hypothesis that they act cooperatively. the converse is false.

Production externalities : cooperative and non-cooperative approaches

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal

Literary meals in Canada : the Food/books of Austin Clarke, Hiromi Goto, Tessa McWatt and Fred Wah

Literary Meals in Canada étudie Pig Tails ’n Breadfruit d'Austin Clarke, Chorus of Mushrooms et The Kappa Child de Hiromi Goto, This Body de Tessa McWatt, ainsi que Diamond Grill de Fred Wah. Cette thèse entreprend d’établir la signification de la nourriture dans ces récits, ce qu'elle permet aux auteur(e)s d'exprimer par rapport à divers thématiques—les structures sociales, la culture, le langage, ou encore la subjectivité—et comment ils/elles établissent des connexions entre elles, et quelles conclusions ils/elles en tirent. En d'autres termes, cette thèse s'interroge sur les stratégies utilisées par ces auteur(e)s lorsqu'ils écrivent de la “nourritéra-ture.” Ma lecture de ces oeuvres est aussi ancrée au sein d'une conversation sur la nourriture au sens large: que ce soit dans les cercles académiques, dans les supermarchés, par l'intermédiaire des étiquettes, ou dans les médias. J'examine comment mon corpus littéraire répond, infirme, ou confirme les discours actuels sur la nourriture. Divisé en quatre chapitres—Production, Approvisionnement, Préparation, et Consommation—ce mémoire précise la signification du “literary supermarket” de Rachel Bowlby, en s'appuyant sur les travaux de Michael Pollan et Hiromi Goto; compare la haute cuisine d'Escoffier à la “hot-cuisine” d'Austin Clarke; recherche les connections entre l’acte de faire la cuisine et celui de l’écrire chez Luce Giard, Austin Clarke, et Fred Wah; confronte les préceptes d'Emily Post concernant les bonnes manières de la table à la cacophonie et aux bruits de mastication chez Hiromi Goto; et relie Tessa McWatt et Elspeth Probyn qui partagent, toutes deux, un intérêt et une approche à la sustentation des corps. Les textes qui composent ce corpus sont des “foodbooks” (“aliment-textes”). La nourriture, et les différentes activités qui y sont associées, y est transcrite. C’est pourquoi cette thèse accorde une grande importance aux particularités de ce moyen d'expression.

Cooperative caching techniques for mobile ad hoc networks

Data caching can remarkably improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. The cache placement problem minimizes total data access cost in ad hoc networks with multiple data items. The ad hoc networks are multi hop networks without a central base station and are resource constrained in terms of channel bandwidth and battery power. By data caching the communication cost can be reduced in terms of bandwidth as well as battery energy. As the network node has limited memory the problem of cache placement is a vital issue. This paper attempts to study the existing cooperative caching techniques and their suitability in mobile ad hoc networks.

A key based cache replacement policy for cooperative caching in mobile ad hoc networks

Cooperative caching in mobile ad hoc networks aims at improving the efficiency of information access by reducing access latency and bandwidth usage. Cache replacement policy plays a vital role in improving the performance of a cache in a mobile node since it has limited memory. In this paper we propose a new key based cache replacement policy called E-LRU for cooperative caching in ad hoc networks. The proposed scheme for replacement considers the time interval between the recent references, size and consistency as key factors for replacement. Simulation study shows that the proposed replacement policy can significantly improve the cache performance in terms of cache hit ratio and query delay

A Novel Cache Resolution Technique For Cooperative Caching In Wireless Mobile Networks

Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the mobile clients while retrieving data and to reduce the traffic load in the network. Caching also increases the availability of data due to server disconnections. The implementation of a cooperative caching technique essentially involves four major design considerations (i) cache placement and resolution, which decides where to place and how to locate the cached data (ii) Cache admission control which decides the data to be cached (iii) Cache replacement which makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e. maintaining consistency between the data in server and cache. In this paper we propose an effective cache resolution technique, which reduces the number of messages flooded in to the network to find the requested data. The experimental results gives a promising result based on the metrics of studies.

A virtual backbone based approach for cooperative caching in mobile ad hoc networks

Cache look up is an integral part of cooperative caching in ad hoc networks. In this paper, we discuss a cooperative caching architecture with a distributed cache look up protocol which relies on a virtual backbone for locating and accessing data within a cooperate cache. Our proposal consists of two phases: (i) formation of a virtual backbone and (ii) the cache look up phase. The nodes in a Connected Dominating Set (CDS) form the virtual backbone. The cache look up protocol makes use of the nodes in the virtual backbone for effective data dissemination and discovery. The idea in this scheme is to reduce the number of nodes involved in cache look up process, by constructing a CDS that contains a small number of nodes, still having full coverage of the network. We evaluated the effect of various parameter settings on the performance metrics such as message overhead, cache hit ratio and average query delay. Compared to the previous schemes the proposed scheme not only reduces message overhead, but also improves the cache hit ratio and reduces the average delay