胆小鬼
发表于 2025-3-28 17:15:52
Computing Stable Coalitions: Approximation Algorithms for Reward Sharing,blem of welfare maximization; we apply this to compute an approximately core stable solution that extracts one-fourth of the optimal social welfare for the class of subadditive valuations. We also show much stronger results for several popular sub-classes: anonymous, fractionally subadditive, and su
Orchiectomy
发表于 2025-3-28 19:23:46
http://reply.papertrans.cn/103/10217/1021690/1021690_42.png
供过于求
发表于 2025-3-29 00:23:59
http://reply.papertrans.cn/103/10217/1021690/1021690_43.png
Cloudburst
发表于 2025-3-29 05:58:44
http://reply.papertrans.cn/103/10217/1021690/1021690_44.png
容易生皱纹
发表于 2025-3-29 10:21:13
http://reply.papertrans.cn/103/10217/1021690/1021690_45.png
Spartan
发表于 2025-3-29 12:01:41
http://reply.papertrans.cn/103/10217/1021690/1021690_46.png
摆动
发表于 2025-3-29 17:21:17
Online Allocation and Pricing with Economies of Scale,fficiently produce such an allocation with cost at most a constant factor greater than the minimum over such allocations in hindsight, so long as the marginal costs do not decrease too rapidly. We also give a bicriteria approximation to social welfare for the case of more general valuation functions
animated
发表于 2025-3-29 21:28:26
Ad Exchange: Envy-Free Auctions with Mediators, We develop a game-theoretic model for the entanglement of the . auction at the ad exchange with the . auctions at the ad networks. We consider the incentives of all three involved parties and suggest a ., an extension of the Walrasian equilibrium that ensures envy-freeness for all participants. We
Simulate
发表于 2025-3-30 02:12:36
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Costo show that the problem of computing a Nash equilibrium in Shapley network cost sharing games is .-complete even in undirected graphs, where previous hardness results where known only in the directed case.
Perineum
发表于 2025-3-30 07:39:38
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction,ality. We prove this bicriteria guarantee is asymptotically (almost) tight..Finally, we examine what strategies are required to ensure individual rationality in the SMRA with general valuation functions. First, we provide a weak characterization, namely ., for individual rationality. We then show th