Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines

Author:

Chen Xujin,Du Donglei,Zuluaga Luis F.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Reference17 articles.

1. Ashlagi, I., Dobzinski, S., Lavi, R.: Optimal lower bounds for anonymous scheduling mechanisms. Math. Oper. Res. 37 (2), 244–258 (2012)

2. Bertsekas, D.P.: Nonlinear Programming, 2nd. Athena Scientific (1999)

3. Christodoulou, G., Koutsoupias, E., Vidali, A.: A characterization of 2-player mechanisms for scheduling. In: Proceedings of the 16th annual European symposium on Algorithms, ESA’08, pp 297–307. Springer-Verlag, Berlin, Heidelberg (2008)

4. Clayton, D.G.: A model for association in bivariate life tables and its application in epidemiological studies of familial tendency in chronic disease incidence. Biometrika 65 (1), 141–151 (1978)

5. Dobzinski, S., Sundararajan, M.: On characterizations of truthful mechanisms for combinatorial auctions and scheduling. In: Proceedings of the 9th ACM conference on Electronic commerce, EC’08, pp 38–47. ACM, New York, NY, USA (2008)

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

1. A Proof of the Nisan-Ronen Conjecture;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. On the Nisan-Ronen conjecture;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

3. A New Lower Bound for Deterministic Truthful Scheduling;Algorithmica;2021-06-23

4. On the Nisan-Ronen conjecture for submodular valuations;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06

5. A New Lower Bound for Deterministic Truthful Scheduling;Algorithmic Game Theory;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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