Bayesian agency: linear versus tractable contracts (Q2124461): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4214693618
@@ Property / OpenAlex ID: W4214693618 / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
+Normal rank
@@ Property / cites work @@
+An Analysis of the Principal-Agent Problem
@@ Property / cites work: An Analysis of the Principal-Agent Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Repeated Moral Hazard
@@ Property / cites work: Repeated Moral Hazard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4902563
@@ Property / cites work: Q4902563 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial agency
@@ Property / cites work: Combinatorial agency / rank @@
+Normal rank
@@ Property / cites work @@
+Free-Riding and Free-Labor in Combinatorial Agency
+Normal rank
@@ Property / cites work @@
+Mixed Strategies in Combinatorial Agency
@@ Property / cites work: Mixed Strategies in Combinatorial Agency / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Contracts
@@ Property / cites work: The Complexity of Contracts / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2124461