## Abstract In this paper we develop a simulationβbased approach to stochastic dynamic programming. To solve the Bellman equation we construct Monte Carlo estimates of __Q__βvalues. Our method is scalable to high dimensions and works in both continuous and discrete state and decision spaces while a
A stochastic dynamic programming approach to decision making in arranged marriages
β Scribed by Amitrajeet A. Batabyal; Hamid Beladi
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 203 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
Information retrieval IR can be regarded as a natural instance of multicriteria decision Ε½ . making MCDM . Queries are formulated as selection criteria aggregated by means of appropriate operators. Retrieval is then performed as a MCDM process by evaluating the degrees of satisfaction of the criteri