Image from Google Jackets

Web and Internet Economics [electronic resource] : 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014. Proceedings / edited by Tie-Yan Liu, Qi Qi, Yinyu Ye.

Contributor(s): Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science ; 8877Publication details: Cham : Springer International Publishing, 2014.Description: 1 online resource (XIV, 500 p. 24 ill.)ISBN:
  • 9783319131290
Subject(s): Online resources:
Contents:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Materials specified Status Date due Barcode Item holds
Books Books National Library of India Available EBK000024806ENG
Total holds: 0

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.

There are no comments on this title.

to post a comment.
                                                                           
web counter

Copyright ©2020 The National Library of India, Govt. of India ↔ Hosted by NVLI, MOC ↔ Technology and Design by National Library of India, Ministry of Culture, Govt. of India