Scholarlink

<p>We study the problem of an organization that has a large number of potential tasks and has to choose which tasks to handle and which pair of experts should be assigned to each of them. We propose a mechanism that generates a Pareto-efficient assignment in the weak core and is group strategy-proof. The assignment rule generated by this mechanism is characterized by four axioms: Pareto-efficiency, the Weak Core property, Restricted Maskin Monotonicity and Invariance with respect to Deleted Links. The last two axioms are invariance properties with respect to specific preference changes.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Assigning tasks to pairs

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年11月29日

查看全文
  • Antonio Nicolò,
  • Pietro Salmaso,
  • Arunava Sen,
  • Sonal Yadav

摘要

We study the problem of an organization that has a large number of potential tasks and has to choose which tasks to handle and which pair of experts should be assigned to each of them. We propose a mechanism that generates a Pareto-efficient assignment in the weak core and is group strategy-proof. The assignment rule generated by this mechanism is characterized by four axioms: Pareto-efficiency, the Weak Core property, Restricted Maskin Monotonicity and Invariance with respect to Deleted Links. The last two axioms are invariance properties with respect to specific preference changes.