arrow
Return

A Bayesian approach to continuous type principal-agent problems

delete2020-02-01
delete5
delete
OA
AI
A
A. George Assaf
R
Ruijun Bu
E
Efthymios G. Tsionas *
DOI:10.1016/j.ejor.2019.07.058delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Singham (2019) proposed an important advance in the numerical solution of continuous type principal-agent problems using Monte Carlo simulations from the distribution of agent types followed by boot-strapping. In this paper, we propose a Bayesian approach to the problem which produces nearly the same results without the need to rely on optimization or lower and upper bounds for the optimal value of the objective function. Specifically, we cast the problem in terms of maximizing the posterior expectation with respect to a suitable posterior measure. In turn, we use efficient Markov Chain Monte Carlo techniques to perform the computations. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Pricing
Principal-agent models
Bayesian analysis
Markov chain Monte Carlo
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

U
university of massachusetts system
Scholars:
3.8W
Papers: 3.5W
Citations: 42
U
University of Massachusetts Amherst
Scholars:
1.1W
Papers: 8.9K
Citations: 19
U
University of Liverpool
Scholars:
2.8W
Papers: 2.5W
Citations: 3.5W
researcher View more organizations