Efficient Teamwork

Endre Csóka

Efficient Teamwork

Endre Csóka

February 6, 2006cs.OHarXiv:cs/0602009

Abstract

Our goal is to solve both problems of adverse selection and moral hazard for multi-agent projects. In our model, each selected agent can work according to his private "capability tree". This means a process involving hidden actions, hidden chance events and hidden costs in a dynamic manner, and providing contractible consequences which are affecting each other's working process and the outcome of the project. We will construct a mechanism that induces truthful revelation of the agents' capability trees and chance events and to follow the instructions about their hidden decisions. This enables the planner to select the optimal subset of agents and obtain the efficient joint execution. We will construct another mechanism that is collusion-resistant but implements an only approximately efficient outcome. The latter mechanism is widely applicable, and the major application details will be elaborated.

Create a lesson

Add papers

Read and save

Open PDF Open on arXiv

Paper details

51 pages. It contains some colored figures on the first few pages, but these are readable in black and white

Versions: v1 (2/6/2006), v2 (2/10/2006), v3 (2/13/2006), v4 (2/14/2006), v5 (2/24/2006), v6 (2/27/2006), v7 (2/28/2006), v8 (3/21/2006), v9 (3/22/2006), v10 (4/29/2006), v11 (6/10/2006), v12 (6/14/2006), v13 (6/16/2006), v14 (6/20/2006), v15 (6/22/2006), v16 (7/11/2006), v17 (7/12/2006), v18 (7/15/2006), v19 (8/3/2006), v20 (8/4/2006), v21 (8/9/2006), v22 (8/30/2006), v23 (9/9/2006), v24 (9/20/2006), v25 (9/20/2006), v26 (9/24/2006), v27 (9/25/2006), v28 (9/27/2006), v29 (9/28/2006), v30 (9/30/2006), v31 (10/3/2006), v32 (10/5/2006), v33 (10/8/2006), v34 (10/10/2006), v35 (10/12/2006), v36 (10/15/2006), v37 (10/18/2006), v38 (10/24/2006), v39 (10/27/2006), v40 (10/31/2006), v41 (11/1/2006), v42 (11/7/2006), v43 (11/8/2006), v44 (11/13/2006), v45 (1/3/2007), v46 (2/16/2007), v47 (2/20/2007), v48 (4/12/2007), v49 (4/18/2007), v50 (4/19/2007), v51 (7/15/2007), v52 (7/17/2007), v53 (7/18/2007), v54 (7/23/2007), v55 (8/2/2007), v56 (8/10/2007), v57 (8/13/2007), v58 (8/15/2007), v59 (8/21/2007), v60 (8/28/2007), v61 (8/29/2007), v62 (9/11/2007), v63 (9/30/2007), v64 (10/15/2007), v65 (10/31/2007), v66 (11/19/2007), v67 (11/20/2007), v68 (11/22/2007), v69 (11/25/2007), v70 (11/29/2007), v71 (11/29/2007), v72 (1/15/2008), v73 (1/18/2008), v74 (1/22/2008), v75 (1/26/2008), v76 (1/30/2008), v77 (2/13/2008), v78 (3/18/2008), v79 (3/18/2008), v80 (4/8/2008), v81 (4/15/2008), v82 (4/16/2008), v83 (4/29/2008), v84 (5/13/2008), v85 (6/9/2008), v86 (9/24/2008), v87 (9/25/2008), v88 (9/28/2008), v89 (10/6/2008), v90 (4/19/2009), v91 (4/22/2009), v92 (5/13/2009), v93 (6/2/2011), v94 (9/8/2012), v95 (2/11/2013), v96 (6/24/2013), v97 (2/22/2014), v98 (6/5/2015), v99 (8/20/2015), v100 (2/8/2016), v101 (4/14/2016), v102 (1/9/2017), v103 (1/10/2018)

Abstract

Create a lesson

Related papers