AbstractCertain zero‐sum games are examined in which an individual player is opposed by a two‐man team. The members of the team have identical interests, but must act separately during play. Most of the paper is devoted to instances in which one teammate has an opportunity to communicate to the other about their mutual opponent's strategy; but he may only be able to transmit a limited amount of information and his choice of a "message" may affect the payoff. The team must thus make economically efficient use of a limited communication opportunity. The present paper treats a variety of models, all of which are formulated as rectangular (matrix) games. Related models, some of which cannot be so formulated either because of restrictions on the team's opportunities to use mixed strategies or because they are non‐zero‐sum games, will be treated in another paper.
Although, as a result of a boom in tin prices, Kuala Lumpur grew very rapidly in the last two years of the 1870s, and the headquarters of the British administration of Selangor were moved there from Klang in 1880, it still remained a pioneer mining town. A number of contemporary descriptions exist of the town (admittedly seen through European eyes), as it was in the late 1870s and early 1880s. These all portray a small, but bustling, "raw and rumbustious" settlement, with a very large Chinese element in its population; indeed, one visitor in 1879 termed it a "great Chinese village". This settlement consisted almost wholly of wooden, attap or mud houses, arranged in the haphazard manner which had resulted from its rapid and unplanned growth. One of the major hazards which the town faced at this time was fire, and it was mainly through the fear of extensive fires that the town began to be replanned and rebuilt during the 1880s.
AbstractThis paper presents some mathematical and numerical results concerning certain one‐machine discrete‐time queueing models, subject to various queue disciplines. Interest is focused upon systems in which service order is governed by "dynamic priorities," under which a customer's relative priority is in effect upgraded with the passage of waiting time, so that the proportion of newcomers who can "step in front of him" becomes smaller and smaller as he waits.