Robustness and approximation for the linear contract design
type: Item
instance of: scholarly article
title: Robustness and approximation for the linear contract design
zbMATH Open document ID: 1481.91101
DOI: 10.1007/978-3-030-57602-8_25
author: Guichen Gao
author: Xinxin Han
author: Li Ning
author: Hing-Fung Ting
author: Yong Zhang
publication date: 2021-07-05T00:00:00Z
Mathematics Subject Classification ID: 91B41
zbMATH DE Number: 7367765
MaRDI profile type: Publication
full work available at URL: 978-3-030-57602-8 25
OpenAlex ID: W3047692151
cites work: Combinatorial agency
cites work: A principal-agent model of bidding firms in multi-unit auctions
cites work: Goal setting in the principal-agent model: weak incentives for strong performance
cites work: Dynamic programming approach to principal-agent problems
cites work: Contracting under uncertainty: a principal-agent model with ambiguity averse parties
cites work: Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
cites work: Sample average approximation for the continuous type principal-agent problem
cites work: Consistency between principal and agent with differing time horizons: computing incentives under risk
cites work: Q4586629
description: scientific article; zbMATH DE number 7367765