First Order Dominance: Stronger Characterization and Bivariate Checking Algorithm

Troels Martin Range; Lars Peter Østerdal

First Order Dominance: Stronger Characterization and Bivariate Checking Algorithm

Troels Martin Range, Lars Peter Østerdal

Syddansk Universitet

Publikation: Working paper › Forskning

Abstrakt

How to determine if a finite distribution is superior to - i.e. first order dominates - another is a fundamental problem with many applications in economics, finance, probability theory and statistics. Nevertheless, little is known about how to efficiently check first order dominance in two or more dimensions. Utilizing that this problem can be formulated as a transportation problem having a special structure we provide a stronger characterization of multivariate first order dominance and develop a linear time complexity checking algorithm for the bivariate case.

Originalsprog	Engelsk
Udgivelsessted	Odense
Udgiver	Syddansk Universitet
Antal sider	22
Status	Udgivet - jun. 2015
Udgivet eksternt	Ja

Bibliografisk note

Previous version: Discussion Papers on Business and Economics, SDU, No. 9/2013. May 2

Emneord

Multivariate first order dominance
Usual stochastic order
Characterization
Network problem
Checking algorithm

Adgang til dokumentet

https://sites.google.com/site/lposterdal/new_bivariate_alg.pdf?attredirects=0&d=1Licens: Ikke-specificeret

Handle.net

Persistent link

Citationsformater

@techreport{37a4e308e0404e2e84f61a501624c1b3,

title = "First Order Dominance: Stronger Characterization and Bivariate Checking Algorithm",

abstract = "How to determine if a finite distribution is superior to - i.e. first order dominates - another is a fundamental problem with many applications in economics, finance, probability theory and statistics. Nevertheless, little is known about how to efficiently check first order dominance in two or more dimensions. Utilizing that this problem can be formulated as a transportation problem having a special structure we provide a stronger characterization of multivariate first order dominance and develop a linear time complexity checking algorithm for the bivariate case.",

keywords = "Multivariate first order dominance, Usual stochastic order, Characterization, Network problem, Checking algorithm, Multivariate first order dominance, Usual stochastic order, Characterization, Network problem, Checking algorithm",

author = "Range, {Troels Martin} and {\O}sterdal, {Lars Peter}",

note = "Previous version: Discussion Papers on Business and Economics, SDU, No. 9/2013. May 2",

year = "2015",

month = jun,

language = "English",

publisher = "Syddansk Universitet",

type = "WorkingPaper",

institution = "Syddansk Universitet",

}

TY - UNPB

T1 - First Order Dominance

T2 - Stronger Characterization and Bivariate Checking Algorithm

AU - Range, Troels Martin

AU - Østerdal, Lars Peter

N1 - Previous version: Discussion Papers on Business and Economics, SDU, No. 9/2013. May 2

PY - 2015/6

Y1 - 2015/6

N2 - How to determine if a finite distribution is superior to - i.e. first order dominates - another is a fundamental problem with many applications in economics, finance, probability theory and statistics. Nevertheless, little is known about how to efficiently check first order dominance in two or more dimensions. Utilizing that this problem can be formulated as a transportation problem having a special structure we provide a stronger characterization of multivariate first order dominance and develop a linear time complexity checking algorithm for the bivariate case.

AB - How to determine if a finite distribution is superior to - i.e. first order dominates - another is a fundamental problem with many applications in economics, finance, probability theory and statistics. Nevertheless, little is known about how to efficiently check first order dominance in two or more dimensions. Utilizing that this problem can be formulated as a transportation problem having a special structure we provide a stronger characterization of multivariate first order dominance and develop a linear time complexity checking algorithm for the bivariate case.

KW - Multivariate first order dominance

KW - Usual stochastic order

KW - Characterization

KW - Network problem

KW - Checking algorithm

KW - Multivariate first order dominance

KW - Usual stochastic order

KW - Characterization

KW - Network problem

KW - Checking algorithm

M3 - Working paper

BT - First Order Dominance

PB - Syddansk Universitet

CY - Odense

ER -