منابع مشابه
Sequential Detection under Markov Dependence
In this paper, we investigate a sequential test for binary hypothesis testing for stationary, first-order Markov dependent observations in steady state. Wald’s first and second lemmas are generalized. For a Markov chain with symmetric transition probability matrix the average sample number required by the test to decide a hypothesis is derived. Numerical analysis shows that accounting for a pos...
متن کاملDependence theory via game theory
In the multi-agent systems community, dependence theory and game theory are often presented as two alternative perspectives on the analysis of social interaction. Up till now no research has been done relating these two approaches. The unification presented provides dependence theory with the sort of mathematical foundations which still lacks, and shows how game theory can incorporate dependenc...
متن کاملEnergy Scheduling in Power Market under Stochastic Dependence Structure
Since the emergence of power market, the target of power generating utilities has mainly switched from cost minimization to revenue maximization. They dispatch their power energy generation units in the uncertain environment of power market. As a result, multi-stage stochastic programming has been applied widely by many power generating agents as a suitable tool for dealing with self-scheduling...
متن کاملLimit Theory for Panel Data Models with Cross Sectional Dependence and Sequential Exogeneity.
The paper derives a general Central Limit Theorem (CLT) and asymptotic distributions for sample moments related to panel data models with large n. The results allow for the data to be cross sectionally dependent, while at the same time allowing the regressors to be only sequentially rather than strictly exogenous. The setup is sufficiently general to accommodate situations where cross sectional...
متن کاملHeap Dependence Analysis for Sequential Programs
In this paper we demonstrate a novel intra-procedural technique for detecting heap dependences in sequential programs that use recursive data structures. The novelty of our technique lies in the way we compute, for each statement, abstract heap access paths that approximate the locations accessed by the statement, and the way we convert these paths into equations that can be solved using tradit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Mathematical Sociology
سال: 2008
ISSN: 0022-250X,1545-5874
DOI: 10.1080/00222500801931669