Results 1 - 10 of 18,803

The Nash Bargaining Solution in Economic Modeling

by Ken Binmore, Ariel Rubinstein, Asher Wolinsky - Rand Journal of Economics , 1986
"... This article establishes the relationship between the static axiomatic theory of bargaining and the sequential strategic approach to bargaining. We consider two strategic models of alternating offers. The models differ in the source of the incentive of the bargaining parties to reach agreement: the ..."
Abstract - Cited by 563 (1 self) - Add to MetaCart
This article establishes the relationship between the static axiomatic theory of bargaining and the sequential strategic approach to bargaining. We consider two strategic models of alternating offers. The models differ in the source of the incentive of the bargaining parties to reach agreement

A universal algorithm for sequential data compression

by Jacob Ziv, Abraham Lempel - IEEE TRANSACTIONS ON INFORMATION THEORY , 1977
"... A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainabl ..."
Abstract - Cited by 1522 (7 self) - Add to MetaCart
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios

A direct approach to false discovery rates

by John D. Storey , 2002
"... Summary. Multiple-hypothesis testing involves guarding against much more complicated errors than single-hypothesis testing. Whereas we typically control the type I error rate for a single-hypothesis test, a compound error rate is controlled for multiple-hypothesis tests. For example, controlling the ..."
Abstract - Cited by 775 (14 self) - Add to MetaCart
the false discovery rate FDR traditionally involves intricate sequential p-value rejection methods based on the observed data. Whereas a sequential p-value method fixes the error rate and estimates its corresponding rejection region, we propose the opposite approach—we fix the rejection region

Structural equation modeling in practice: a review and recommended two-step approach.

by James C Anderson , J L Kellogg , David W Gerbing , Jeanne Brett , Claes Fornell , David Larcker , William Perreault Jr , James Steiger - Psychological Bulletin, , 1988
"... In this article, we provide guidance for substantive researchers on the use of structural equation modeling in practice for theory testing and development. We present a comprehensive, two-step modeling approach that employs a series of nested models and sequential chi-square difference tests. We di ..."
Abstract - Cited by 1825 (3 self) - Add to MetaCart
In this article, we provide guidance for substantive researchers on the use of structural equation modeling in practice for theory testing and development. We present a comprehensive, two-step modeling approach that employs a series of nested models and sequential chi-square difference tests. We

Estimating the Support of a High-Dimensional Distribution

by Bernhard Schölkopf, John C. Platt, John Shawe-taylor, Alex J. Smola, Robert C. Williamson , 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract - Cited by 783 (29 self) - Add to MetaCart
propose a method to approach this problem by trying to estimate a function f which is positive on S and negative on the complement. The functional form of f is given by a kernel expansion in terms of a potentially small subset of the training data; it is regularized by controlling the length

A framework for information systems architecture.

by J A Zachman - IBM Syst. J., , 1987
"... With increasing size and complexity of the implementations of information systems, it is necessary to use some logical construct (or architecture) for defining and controlling the interfaces and the integration of all of the components of the system. This paper defines information systems architect ..."
Abstract - Cited by 546 (0 self) - Add to MetaCart
are drawn. The discussion is limited to architecture and does not include a strategic planning methodology. T he subject of information systems architecture is beginning to receive considerable attention. The increased scope of design and levels of complexity of information systems implementations

Max-margin Markov networks

by Ben Taskar, Carlos Guestrin, Daphne Koller , 2003
"... In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the margin of confidence of the classifier, are the method of choice for many such tasks. Their popularity stems both from the ..."
Abstract - Cited by 604 (15 self) - Add to MetaCart
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the margin of confidence of the classifier, are the method of choice for many such tasks. Their popularity stems both from

Multipoint quantitative-trait linkage analysis in general pedigrees

by Laura Almasy, John Blangero - Am. J. Hum. Genet , 1998
"... Multipoint linkage analysis of quantitative-trait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variance-component linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint i ..."
Abstract - Cited by 567 (60 self) - Add to MetaCart
identity-by-descent (IBD) probability calculations. We extend the sib-pair multi-point mapping approach of Fulker et al. to general rel-ative pairs. This multipoint IBD method uses the pro-portion of alleles shared identical by descent at genotyped loci to estimate IBD sharing at arbitrary points along a

A theory of sequential reciprocity

by Martin Dufwenberg, Georg Kirchsteiger - Games and Economic Behavior , 1998
"... Abstract: Many experimental studies indicate that people are motivated by reciprocity. Rabin (1993) develops techniques for incorporating such concerns into game theory and economics. His model, however, does not fare well when applied to situations with an interesting dynamic structure (like many e ..."
Abstract - Cited by 398 (17 self) - Add to MetaCart
experimental games), because it is developed for normal form games in which information about the sequential structure of a strategic situation is suppressed. In this paper we develop a theory of reciprocity for extensive games in which the sequential structure of a strategic situation is made explicit. We

Convergent Tree-reweighted Message Passing for Energy Minimization

by Vladimir Kolmogorov - ACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2006. ABSTRACTACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI) , 2006
"... Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33]- tree-reweighted max-product message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy ..."
Abstract - Cited by 489 (16 self) - Add to MetaCart
on the energy. However, the algorithm is not guaranteed to increase this bound- it may actually go down. In addition, TRW does not always converge. We develop a modification of this algorithm which we call sequential tree-reweighted message passing. Its main property is that the bound is guaranteed
Results 1 - 10 of 18,803