Free-Riding and Free-Labor in Combinatorial Agency
From MaRDI portal
Publication:3648847
DOI10.1007/978-3-642-04645-2_11zbMath1262.91102OpenAlexW1575486008MaRDI QIDQ3648847
Noam Nisan, Moshe Babaioff, Michal Feldman
Publication date: 1 December 2009
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04645-2_11
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Bayesian agency: linear versus tractable contracts ⋮ Technical Change and the Decentralization Penalty ⋮ Designing menus of contracts efficiently: the power of randomization ⋮ Verifiable crowd computing: coping with bounded rationality ⋮ Contribution games in networks ⋮ Crowd computing as a cooperation problem: An evolutionary approach ⋮ Computing optimal contracts in combinatorial agencies ⋮ Bounds on the welfare loss from moral hazard with limited liability
This page was built for publication: Free-Riding and Free-Labor in Combinatorial Agency
