Satiation in Fisher Markets and Approximation of Nash Social Welfare
Satiation in Fisher Markets and Approximation of Nash Social Welfare
复制标题
水产市场的饱和度和纳什社会福利的近似
DOI:
10.1287/moor.2019.0129
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
K. Mehlhorn
中科院分区:
文献类型:
--
作者:
J. Garg;M. Hoefer;K. Mehlhorn
We study linear Fisher markets with satiation. In these markets, sellers have earning limits, and buyers have utility limits. Beyond applications in economics, they arise in the context of maximizing Nash social welfare when allocating indivisible items to agents. In contrast to markets with either earning or utility limits, markets with both limits have not been studied before. They turn out to have fundamentally different properties. In general, the existence of competitive equilibria is not guaranteed. We identify a natural property of markets (termed money clearing) that implies existence. We show that the set of equilibria is not always convex, answering a question posed in the literature. We design an FPTAS to compute an approximate equilibrium and prove that the problem of computing an exact equilibrium lies in the complexity class continuous local search ([Formula: see text]; i.e., the intersection of polynomial local search ([Formula: see text]) and polynomial parity arguments on directed graphs ([Formula: see text])). For a constant number of buyers or goods, we give a polynomial-time algorithm to compute an exact equilibrium. We show how (approximate) equilibria can be rounded and provide the first constant-factor approximation algorithm (with a factor of 2.404) for maximizing Nash social welfare when agents have capped linear (also known as budget-additive) valuations. Finally, we significantly improve the approximation hardness for additive valuations to [Formula: see text]. Funding: J. Garg was supported by the National Science Foundation [Grant CCF-1942321 (CAREER)]. M. Hoefer was supported by Deutsche Forschungsgemeinschaft [Grants Ho 3831/5-1, Ho 3831/6-1, and Ho 3831/7-1].
登录
查看更多内容
DOI:
10.1145/3313276.3316340
发表时间:
2018-09
期刊:
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
影响因子:
--
作者:
J. Garg;László A. Végh
通讯作者:
J. Garg;László A. Végh
影响因子:
5
作者:
Chaudhury, Bhaskar Ray;Cheung, Yun Kuen;Garg, Jugal;Garg, Naveen;Hoefer, Martin;Mehlhorn, Kurt
通讯作者:
Mehlhorn, Kurt
影响因子:
1.2
作者:
Bei, Xiaohui;Garg, Jugal;Hoefer, Martin;Mehlhorn, Kurt
通讯作者:
Mehlhorn, Kurt
影响因子:
--
作者:
Chaudhury, Bhaskar Ray;Cheung, Yun Kuen;Garg, Jugal;Garg, Naveen;Hoefer, Martin;Mehlhorn, Kurt
通讯作者:
Mehlhorn, Kurt