Auction Theory for Computer Networks at Meripustak

Auction Theory for Computer Networks

Books from same Author: Dusit Niyato

Books from same Publisher: Cambridge University Press

Related Category: Author List / Publisher List


  • Retail Price: ₹ 10385/- [ 13.00% off ]

    Seller Price: ₹ 9035

Sold By: T K Pandey      Click for Bulk Order

Offer 1: Get ₹ 111 extra discount on minimum ₹ 500 [Use Code: Bharat]

Offer 2: Get 13.00 % + Flat ₹ 100 discount on shopping of ₹ 1500 [Use Code: IND100]

Offer 3: Get 13.00 % + Flat ₹ 300 discount on shopping of ₹ 5000 [Use Code: MPSTK300]

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

Free Shipping Available



Click for International Orders
  • Provide Fastest Delivery

  • 100% Original Guaranteed
  • General Information  
    Author(s)Dusit Niyato
    PublisherCambridge University Press
    Edition1st Edition
    ISBN9781108480765
    Pages288
    BindingHardcover
    LanguageEnglish
    Publish YearJuly 2020

    Description

    Cambridge University Press Auction Theory for Computer Networks by Dusit Niyato

    Do you have the tools to address recent challenges and problems in modern computer networks? Discover a unified view of auction theoretic applications and develop auction models, solution concepts, and algorithms with this multidisciplinary review. Devise distributed, dynamic, and adaptive algorithms for ensuring robust network operation over time-varying and heterogeneous environments, and for optimizing decisions about services, resource allocation, and usage of all network entities. Topics including cloud networking models, MIMO, mmWave communications, 5G, data aggregation, task allocation, user association, interference management, wireless caching, mobile data offloading, and security. Introducing fundamental concepts from an engineering perspective and describing a wide range of state-of-the-art techniques, this is an excellent resource for graduate and senior undergraduate students, network and software engineers, economists, and researchers.