落叶剂 发表于 2025-3-28 16:59:21

On Improved Interval Cover Mechanisms for Crowdsourcing Marketsasks, for which we provide a truthful FPTAS. Finally, we also highlight connections of our problem with other well-studied optimization problems, out of which, we infer further conclusions on its (in)approximability.

包租车船 发表于 2025-3-28 18:44:56

Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price ofputing a best response is NP-hard. For natural restricted versions where best response is easy to compute, we show that finding a pure-strategy Nash equilibrium is PLS-complete, and finding a mixed-strategy Nash equilibrium is (PPAD.PLS)-complete. On the other hand, an approximate pure-strategy Nash

合同 发表于 2025-3-28 23:30:04

http://reply.papertrans.cn/16/1530/152947/152947_43.png

易达到 发表于 2025-3-29 03:06:31

http://reply.papertrans.cn/16/1530/152947/152947_44.png

ACTIN 发表于 2025-3-29 08:00:15

http://reply.papertrans.cn/16/1530/152947/152947_45.png

陈腐思想 发表于 2025-3-29 15:08:47

https://doi.org/10.1007/978-3-8349-9493-6s with affine demand two firms can never lose more than 1/9 of their profit when merging, and this bound is tight. We also study the asymptotic loss in larger markets, where it is easy to show that the profit loss can be arbitrarily large when multiple firms merge; we give bounds that characterize t

温室 发表于 2025-3-29 18:57:33

http://reply.papertrans.cn/16/1530/152947/152947_47.png

谎言 发表于 2025-3-29 20:17:32

http://reply.papertrans.cn/16/1530/152947/152947_48.png

粗鲁性质 发表于 2025-3-30 03:35:43

Durchsetzung auf nationaler Ebeneasks, for which we provide a truthful FPTAS. Finally, we also highlight connections of our problem with other well-studied optimization problems, out of which, we infer further conclusions on its (in)approximability.

信条 发表于 2025-3-30 05:23:25

http://reply.papertrans.cn/16/1530/152947/152947_50.png
页: 1 2 3 4 [5] 6 7
查看完整版本: Titlebook: Algorithmic Game Theory; 15th International S Panagiotis Kanellopoulos,Maria Kyropoulou,Alexandr Conference proceedings 2022 The Editor(s)