<--- Back to Details
First PageDocument Content
Computer programming / Academia / Mathematical optimization / Software engineering / Equations / Asymmetric information / Game theory / Economic theories / Contract theory / Dynamic programming / Recursion
Date: 2011-02-21 08:55:53
Computer programming
Academia
Mathematical optimization
Software engineering
Equations
Asymmetric information
Game theory
Economic theories
Contract theory
Dynamic programming
Recursion

E¢ cient Allocations with Moral Hazard and Hidden Borrowing and Lending: A Recursive Formulation Árpád Ábrahám y and Nicola Pavoni z MayAbstract

Add to Reading List

Source URL: apps.eui.eu

Download Document from Source Website

File Size: 471,04 KB

Share Document on Facebook

Similar Documents

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem  Nabil Abdennadher

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem Nabil Abdennadher

DocID: 1xTOs - View Document

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

DocID: 1vqMk - View Document

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore   Rahul Jain*

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore Rahul Jain*

DocID: 1vouJ - View Document

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

DocID: 1vhRF - View Document

EE365: Deterministic Finite State Control  Deterministic optimal control Shortest path problem Dynamic programming Examples

EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples

DocID: 1vg0M - View Document