A Stochastic Dynamic Programming Approach to Decision Making in Arranged Marriages
RIT Economics Department Working Paper No. 11-06
13 Pages Posted: 22 Jun 2011
There are 2 versions of this paper
A Stochastic Dynamic Programming Approach to Decision Making in Arranged Marriages
A Stochastic Dynamic Programming Approach to Decision Making in Arranged Marriages
Date Written: June 22, 2011
Abstract
We employ a stochastic dynamic programming approach to study decision making by an individual wishing to have an arranged marriage. First, we show that this individual never opts out of a voluntarily agreed upon marriage. Second, we demonstrate that our marrying individual uses a reservation utility to determine which marriage proposal to accept. Third, we compute the expected length of time during which our marrying individual stays single. Finally, we focus on an arranged marriage market in which there are many identical marrying individuals and profit maximizing matchmaking firms. We show that profit maximization implies that all matchmaking firms offer marriage proposals whose utility equals the reservation utility of our marrying individuals.
Keywords: Arrange Marriage, Decision, Market, Reservation Utility
JEL Classification: J12, D81
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
On the Likelihood of Finding the Right Partner in an Arranged Marriage
-
Introduction to Stochastic Models of Decision Making in Arranged Marriages
-
Meetings and Exposure Before an Arranged Marriage: A Probabilistic Analysis
-
On Decision Making in Arranged Marriages with a Stochastic Reservation Quality Level
-
A Game Model of Dowry Determination in an Arranged Marriage Context
-
On Strategy and the Likelihood of Success in Marital Matchmaking Under Uncertainty
-
To Match or Not to Match: Aspects of Marital Matchmaking Under Uncertainty
-
Mediator Learning and Dowry Determination in an Arranged Marriage Setting