Simple methods for evaluating and comparing binary experiments

We consider a confidence parametrization of binary information sources in terms of appropriate likelihood ratios. This parametrization is used for Bayesian belief updates and for the equivalent comparison of binary experiments. In contrast to the standard parametrization of a binary information source in terms of its specificity and its sensitivity, one of the two confidence parameters is sufficient for a Bayesian belief update conditional on a signal realization. We introduce a confidence-augmented receiver operating characteristic for comparisons of binary experiments for a class of “balanced” decision problems, relative to which the confidence order offers a higher resolution than Blackwell’s informativeness order.

Where observation is concerned, Chance favors only the prepared mind. —Louis Pasteur (1822–1895).

     

Choosing monetary sequences: theory and experimental evidence

We formulate and investigate experimentally a model of how individuals choose between time sequences of monetary outcomes. The model assumes that a decision maker uses, sequentially, two criteria to screen options. Each criterion only permits a decision between some pairs of options, while the other options are incomparable according to that criterion. When the first criterion is not decisive, the decision maker resorts to the second criterion to select an alternative. We find that: (1) traditional economic models based on discounting alone cannot explain a significant (almost 30%) proportion of the data no matter how much variability in the discount functions is allowed; (2) our model, despite considering only a specific (exponential) form of discounting, can explain the data much better solely thanks to the use of the secondary criterion; (3) our model explains certain specific patterns in the choices of the “irrational” people. We reject the hypothesis that anomalous behavior is due simply to random “mistakes” around the basic predictions of discounting theories: deviations are not random and there are clear systematic patterns of association between “irrational” choices.     

Population monotonic path schemes for simple games

A path scheme for a game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path. A path scheme is called population monotonic if a player’s payoff does not decrease as the path coalition grows. In this study, we focus on Shapley path schemes of simple games in which for every path coalition the Shapley value of the associated subgame provides the allocation at hand. Obviously, each Shapley path scheme of a game is population monotonic if and only if the Shapley allocation scheme of the game is population monotonic in the sense of Sprumont (Games Econ Behav 2:378–394, 1990). We prove that a simple game allows for population monotonic Shapley path schemes if and only if the game is balanced. Moreover, the Shapley path scheme of a specific path is population monotonic if and only if the first winning coalition that is formed along the path contains every minimal winning coalition. We also show that each Shapley path scheme of a simple game is population monotonic if and only if the set of veto players of the game is a winning coalition. Extensions of these results to other efficient probabilistic values are discussed.     

Pooling designs associated with unitary space and ratio efficiency comparison

Let mathbbF^(2n+d)_q²mathbb{F}^{(2nu+delta)}_{q^{2}} be a (2ν+δ)-dimensional unitary space of mathbbF_q²mathbb{F}_{q^{2}} , where δ=0 or 1. In this paper we construct a family of inclusion matrices associated with subspaces of mathbbF^(2n+d)_q²mathbb{F}^{(2nu+delta)}_{q^{2}} , and exhibit its disjunct property. Moreover, we compare the ratio efficiency of this construction with others, and find it smaller under some conditions.     

Linearity of regression for non-adjacent record values

Let X₁,X₂,… be a sequence of iid random variables having a continuous distribution; by R₁,R₂,… denote the corresponding record values. All the distributions allowing linearity of regressions either E(R_m+k|R_m) or E(R_m|R_m+k) are identified.     

Accuracy of approximate progressively censored reliability sampling plans for exponential models

Reliability sampling plans provide an efficient method to determine the acceptability of a product based upon the lifelengths of some test units. Usually, they depend on the producer and consumer’s quality requirements and do not admit closed form solutions. Acceptance sampling plans for one- and two-parameter exponential lifetime models, derived by approximating the operating characteristic curve, are presented in this paper. The accuracy of these approximate plans, which are explicitly expressible and valid for failure and progressive censoring, is assessed. The approximation proposed in the one-parameter case is found to be practically exact. Explicit lower and upper bounds on the smallest sample size are given in the two-parameter case. Some additional advantages are also pointed out.