Government of India
Recognizing the ongoing need to position itself for the digital future, Indian Culture is an initiative by the Ministry of Culture. A platform that hosts data of cultural relevance from various repositories and institutions all over India.Indian Culture App
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): Liu, Tie-Yan [edt]
| Qi, Qi [edt] | Ye, Yinyu [edt].
Material type: 
TextSeries: Lecture Notes in Computer Science, 8877. Publisher: Cham : Springer International Publishing, 2014Description: 1 online resource (XIV, 500 p. 24 ill.).ISBN: 9783319131290.Subject(s): Computer scienceOnline resources: Click here to access online
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.
| Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| National Library of India | Available | NLI-EBK000024806ENG |
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.