Mycological contributions of Rolf Singer : field itinerary, index to new taxa, and list of publications / Gregory M. Mueller and Qiuxin Wu, editors.

n.s. no.38(1997)

List of species of mammals, principally rodents, obtained by W. W. Price, S. E. Meek, G. K. Cherrie and E. S. Thompson, in the States of Iowa, Wyoming, Montana, Idaho, Nevada and California, with descriptions of new species, by D. E. Elliot.

v.1:no.10(1898)

Index to volume I, numbers 1 to 17.

v.1:no.18(1900)

Auditory region in bats including Icaronycteris index.

v.58:no.9(1971)

Fast and furious: a look at the death of animals on the highway MS-080, Southwestern Brazil

Several factors, such as hunting and the pet trade, are responsible for the worldwide decline of wildlife populations. In addition, fatal collisions with vehicles on highways have also taken one of the largest tolls. This study aimed to quantify the richness and abundance of vertebrate roadkill along highway MS-080 in Mato Grosso do Sul, Central-West Brazil. We compare the amount of roadkill to the distance between cities, moon phases and the flow of vehicles on the highway. Samples were collected weekly between March and September 2011, totaling 257 individuals, belonging to 32 families and 52 species, resulting in an index of 0.13 individuals hit/km. Birds were the most frequently hit taxa, followed by mammals. The most affected species was Cariama cristata (Cariamidae), followed by Cerdocyon thous (Canidae). The sections of highway closest to cities had the highest number of individual animals killed. Our observations indicate that the density of the vegetation next to the highway positively influences the amount of roadkill.

A provisional host-index of the fungi of the United States, by W.G. Farlow and A.B. Seymour.

pt.1

Tacit collusion and capacity withholding in repeated uniform price auctions

This paper contributes to the study of tacit collusion by analyzing infinitely repeated multiunit uniform price auctions in a symmetric oligopoly with capacity constrained firms. Under both the Market Clearing and Maximum Accepted Price rules of determining the uniform price, we show that when each firm sets a price-quantity pair specifying the firm's minimum acceptable price and the maximum quantity the firm is willing to sell at this price, there exists a range of discount factors for which the monopoly outcome with equal sharing is sustainable in the uniform price auction, but not in the corresponding discriminatory auction. Moreover, capacity withholding may be necessary to sustain this out-come. We extend these results to the case where firms may set bids that are arbitrary step functions of price-quantity pairs with any finite number of price steps. Surprisingly, under the Maximum Accepted Price rule, firms need employ no more than two price steps to minimize the value of the discount factor

Double implementation in a market for indivisible goods with a price constraint

I consider the problem of assigning agents to objects where each agent must pay the price of the object he gets and prices must sum to a given number. The objective is to select an assignment-price pair that is envy-free with respect to the true preferences. I prove that the proposed mechanism will implement both in Nash and strong Nash the set of envy-free allocations. The distinguishing feature of the mechanism is that it treats the announced preferences as the true ones and selects an envy-free allocation with respect to the announced preferences.

Collusion and fights in an experiment with price-setting firms and production in advance

We present results from 50-round market experiments in which firms decide repeatedly both on price and quantity of a completely perishable good. Each firm has capacity to serve the whole market. The stage game does not have an equilibrium in pure strategies. We run experiments for markets with two and three identical firms. Firms tend to cooperate to avoid fights, but when they fight bankruptcies are rather frequent. On average, pricing behavior is closer to that for pure quantity than for pure price competition and price and efficiency levels are higher for two than for three firms. Consumer surplus increases with the number of firms, but unsold production leads to higher efficiency losses with more firms. Over time prices tend to the highest possible one for markets both with two and three firms.

Elicited bid functions in (a)symmetric first-price auctions

We report on a series of experiments that examine bidding behavior in first-price sealed bid auctions with symmetric and asymmetric bidders. To study the extent of strategic behavior, we use an experimental design that elicits bidders' complete bid functions in each round (auction) of the experiment. In the aggregate, behavior is consistent with the basic equilibrium predictions for risk neutral or homogenous risk averse bidders (extent of bid shading, average seller's revenues and deviations from equilibrium). However, when we look at the extent of best reply behavior and the shape of bid functions, we find that individual behavior is not in line with the received equilibrium models, although it exhibits strategic sophistication.

Accuracy vs. simplicity: a complex trade-off

Inductive learning aims at finding general rules that hold true in a database. Targeted learning seeks rules for the predictions of the value of a variable based on the values of others, as in the case of linear or non-parametric regression analysis. Non-targeted learning finds regularities without a specific prediction goal. We model the product of non-targeted learning as rules that state that a certain phenomenon never happens, or that certain conditions necessitate another. For all types of rules, there is a trade-off between the rule's accuracy and its simplicity. Thus rule selection can be viewed as a choice problem, among pairs of degree of accuracy and degree of complexity. However, one cannot in general tell what is the feasible set in the accuracy-complexity space. Formally, we show that finding out whether a point belongs to this set is computationally hard. In particular, in the context of linear regression, finding a small set of variables that obtain a certain value of R2 is computationally hard. Computational complexity may explain why a person is not always aware of rules that, if asked, she would find valid. This, in turn, may explain why one can change other people's minds (opinions, beliefs) without providing new information.