Buch, Englisch, Band 8877, 500 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 7723 g
10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014, Proceedings
Buch, Englisch, Band 8877, 500 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 7723 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-319-13128-3
Verlag: Springer International Publishing
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations.- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.- Limiting Price Discrimination when Selling Products with Positive Network Externalities.- Computing Approximate Nash Equilibria in Polymatrix Games.- Optimal Cost-Sharing in Weighted Congestion Games.- Truthful Multi-unit Procurements with Budgets.- The Shapley Value in Knapsack Budgeted Games.- Fast Convex Decomposition for Truthful Social Welfare Approximation.- A Near-Optimal Mechanism for Impartial Selection.- Value-based Network Externalities and Optimal Auction Design.- Matching Dynamics with Constraints.- Truthful Approximations to Range Voting.- Resource Competition on Integral Polymatroids.- PTAS for Minimax Approval Voting.- Biobjective Online Bipartite Matching.- Dynamic Reserve Prices for Repeated Auctions: Learning from Bids.