Combinatorial auctions with verification are tractable

Author:

Krysta Piotr,Ventre Carmine

Funder

EPSRC

DFG

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference38 articles.

1. An approximate truthful mechanism for combinatorial auctions with single parameter agents;Archer,2003

2. The power of verification for one-parameter agents;Auletta;J. Comput. System Sci.,2009

3. New constructions of mechanisms with verification;Auletta,2006

4. Incentive compatible multi unit combinatorial auctions;Bartal,2003

5. On the computational power of demand queries;Blumrosen;SIAM J. Comput.,2009

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. New Constructions of Obviously Strategyproof Mechanisms;Mathematics of Operations Research;2023-02

2. Computing Sequences of Coalition Structures;2021 IEEE Symposium Series on Computational Intelligence (SSCI);2021-12-05

3. Obviously Strategyproof Mechanisms for Machine Scheduling;LEIBNIZ INT PR INFOR;2019

4. The Power of Verification for Greedy Mechanism Design;Journal of Artificial Intelligence Research;2018-07-04

5. Mechanism Design with Selective Verification;Proceedings of the 2016 ACM Conference on Economics and Computation;2016-07-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3