Identifying and computing the exact core-determining class

The indeterministic relations between unobservable events andobserved outcomes in partially identified models can be characterized bya bipartite graph. Given a probability measure on observed outcomes, theset of feasible probability measures on unobservable events can be definedby a set of linear in...

Full description

Saved in:
Bibliographic Details
Main Authors: LUO, Ye, WANG, Hai
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2018
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/4337
https://ink.library.smu.edu.sg/context/sis_research/article/5340/viewcontent/SSRN_id3154285.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-5340
record_format dspace
spelling sg-smu-ink.sis_research-53402019-05-16T09:26:17Z Identifying and computing the exact core-determining class LUO, Ye WANG, Hai The indeterministic relations between unobservable events andobserved outcomes in partially identified models can be characterized bya bipartite graph. Given a probability measure on observed outcomes, theset of feasible probability measures on unobservable events can be definedby a set of linear inequality constraints, according to Artstein’s Theorem.This set of inequalities is called the “core-determining class”. However, thenumber of inequalities defined by Artstein’s Theorem is exponentially increasing with the number of unobservable events, and many inequalitiesmay in fact be redundant. In this paper, we show that the “exact coredetermining class”, i.e., the smallest possible core-determining class, canbe characterized by a set of combinatorial rules of the bipartite graph. Weprove that if the bipartite graph and the measure on observed outcomesare non-degenerate, the exact core-determining class is unique and it onlydepends on the structure of the bipartite graph. We then propose an algorithm that explores the structure of the bipartite graph to construct theexact core-determining class. We design and implement the model and algorithm in a set of examples to show that our methodology could efficientlydiscard the redundant inequalities that are not useful to identify the parameter of interest. We also demonstrate that, by using the inequalitiescorresponding to the exact core-determining class to perform set inference,the power of test statistics against local alternatives can be improved. 2018-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/4337 info:doi/10.2139/ssrn.3154285 https://ink.library.smu.edu.sg/context/sis_research/article/5340/viewcontent/SSRN_id3154285.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Core-determining Class Inequality Selection Linear Programming Partially Identified Models Set Inference Numerical Analysis and Scientific Computing Software Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Core-determining Class
Inequality Selection
Linear Programming
Partially Identified Models
Set Inference
Numerical Analysis and Scientific Computing
Software Engineering
spellingShingle Core-determining Class
Inequality Selection
Linear Programming
Partially Identified Models
Set Inference
Numerical Analysis and Scientific Computing
Software Engineering
LUO, Ye
WANG, Hai
Identifying and computing the exact core-determining class
description The indeterministic relations between unobservable events andobserved outcomes in partially identified models can be characterized bya bipartite graph. Given a probability measure on observed outcomes, theset of feasible probability measures on unobservable events can be definedby a set of linear inequality constraints, according to Artstein’s Theorem.This set of inequalities is called the “core-determining class”. However, thenumber of inequalities defined by Artstein’s Theorem is exponentially increasing with the number of unobservable events, and many inequalitiesmay in fact be redundant. In this paper, we show that the “exact coredetermining class”, i.e., the smallest possible core-determining class, canbe characterized by a set of combinatorial rules of the bipartite graph. Weprove that if the bipartite graph and the measure on observed outcomesare non-degenerate, the exact core-determining class is unique and it onlydepends on the structure of the bipartite graph. We then propose an algorithm that explores the structure of the bipartite graph to construct theexact core-determining class. We design and implement the model and algorithm in a set of examples to show that our methodology could efficientlydiscard the redundant inequalities that are not useful to identify the parameter of interest. We also demonstrate that, by using the inequalitiescorresponding to the exact core-determining class to perform set inference,the power of test statistics against local alternatives can be improved.
format text
author LUO, Ye
WANG, Hai
author_facet LUO, Ye
WANG, Hai
author_sort LUO, Ye
title Identifying and computing the exact core-determining class
title_short Identifying and computing the exact core-determining class
title_full Identifying and computing the exact core-determining class
title_fullStr Identifying and computing the exact core-determining class
title_full_unstemmed Identifying and computing the exact core-determining class
title_sort identifying and computing the exact core-determining class
publisher Institutional Knowledge at Singapore Management University
publishDate 2018
url https://ink.library.smu.edu.sg/sis_research/4337
https://ink.library.smu.edu.sg/context/sis_research/article/5340/viewcontent/SSRN_id3154285.pdf
_version_ 1770574658965340160