Auction theory for computer networks:
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, United Kingdom ; New York, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore
Cambridge University Press
2020
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 15 May 2020) |
| Beschreibung: | x, 279 Seiten Illustrationen, Diagramme |
| ISBN: | 9781108480765 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046798120 | ||
| 003 | DE-604 | ||
| 005 | 20220705 | ||
| 007 | t | ||
| 008 | 200708s2020 a||| |||| 00||| eng d | ||
| 020 | |a 9781108480765 |9 978-1-10848-076-5 | ||
| 035 | |a (OCoLC)1193282765 | ||
| 035 | |a (DE-599)BVBBV046798120 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 |a DE-91G |a DE-83 | ||
| 082 | 0 | |a 004.601/5193 | |
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a DAT 250 |2 stub | ||
| 084 | |a MAT 920 |2 stub | ||
| 100 | 1 | |a Niyato, Dusit |d 1978- |e Verfasser |0 (DE-588)1077269730 |4 aut | |
| 245 | 1 | 0 | |a Auction theory for computer networks |c Dusit Niyato (Nanyang Technological University), Nguyen Cong Luong (PHENIKAA University), Ping Wang (York University), Zhu Han (University of Houston |
| 264 | 1 | |a Cambridge, United Kingdom ; New York, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore |b Cambridge University Press |c 2020 | |
| 300 | |a x, 279 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 15 May 2020) | ||
| 650 | 4 | |a Auctions / Mathematical models | |
| 650 | 4 | |a Auctions / Computer programs | |
| 650 | 4 | |a Auction theory | |
| 650 | 4 | |a Wireless communication systems | |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Auktionstheorie |0 (DE-588)4732699-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Entität |0 (DE-588)4629260-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Dienstleistung |0 (DE-588)4012178-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Ressourcenallokation |0 (DE-588)4129283-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 0 | 1 | |a Auktionstheorie |0 (DE-588)4732699-2 |D s |
| 689 | 0 | 2 | |a Ressourcenallokation |0 (DE-588)4129283-2 |D s |
| 689 | 0 | 3 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 0 | 4 | |a Dienstleistung |0 (DE-588)4012178-1 |D s |
| 689 | 0 | 5 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 0 | 6 | |a Entität |0 (DE-588)4629260-3 |D s |
| 689 | 0 | |C b |5 DE-604 | |
| 700 | 1 | |a Luong, Nguyen Cong |d ca. 20./21. Jh. |e Verfasser |0 (DE-588)1212077326 |4 aut | |
| 700 | 1 | |a Wang, Ping |d ca. 20./21. Jh. |e Verfasser |0 (DE-588)1212077628 |4 aut | |
| 700 | 1 | |a Han, Zhu |d 1974- |e Verfasser |0 (DE-588)1038496136 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-108-69107-9 |
| 856 | 4 | 2 | |m Digitalisierung UB Regensburg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032206937&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032206937 | ||
Datensatz im Suchindex
| _version_ | 1804181593677365248 |
|---|---|
| adam_text | Contents 1 Introduction 1.1 1.2 1.3 1.4 2 A Brief Overview of the History of Auctions Auction Theory in Computer Networks Organization and Timeliness of This Book 1.3.1 Organization 1.3.2 Timeliness of the Book Acknowledgments page 1 1 2 3 3 7 10 Overview of Modern Computer Networks 11 2.1 11 11 12 14 15 16 18 18 20 21 22 24 25 26 27 29 30 31 33 34 34 35 37 38 Internet of Things 2.1.1 Definitions 2.1.2 IoT Architecture 2.1.3 Resources and Services of IoT 2.1.4 Wireless Sensor Network 2.1.5 Mobile Crowdsensing Network 2.2 Cloud Networking 2.2.1 General Architecture 2.2.2 Cloud Data Center Networking 2.2.3 Mobile Cloud Networking 2.2.4 Edge Computing 2.2.5 Cloud-Based Video-on-Demand System 2.3 5G Wireless Networks 2.3.1 Massive Multiple-Input and Multiple-Output 2.3.2 Heterogeneous Networks 2.3.3 Millimeter Wave Communications 2.3.4 Cognitive Radio 2.3.5 Device-to-Device Communications 2.3.6 Machine-to-Machine Communications 2.4 Data Collection and Resource Management 2.4.1 Data Aggregation 2.4.2 Task Allocation 2.4.3 User Association 2.4.4 Interference Management vii
Contents 3 2.4.5 Wireless Caching 2.4.6 Mobile Data Offloading 2.5 Wireless Network Security 2.5.1 Users and Attackers in Wireless Networks 2.5.2 Eavesdropping Attack 2.5.3 Denial-of-Service Attack 2.5.4 Information Security Issues 2.5.5 Illegitimate Behaviors in Wireless Networks 2.6 Summary 40 42 43 44 44 47 49 50 51 Mechanism Design and Auction Theory in Computer Networks 52 52 52 53 55 57 58 59 60 60 61 63 64 65 68 69 71 3.1 Mechanism Design 3.1.1 Mechanism 3.1.2 Mechanism Design 3.1.3 Revelation Principle 3.1.4 Incentive Compatibility 3.1.5 Individual Rationality 3.1.6 Economic Efficiency and Budget Balance 3.2 Optimal Mechanisms 3.2.1 Social Surplus and Profit 3.2.2 Social Surplus Maximization Problem 3.2.3 Profit Maximization Problem 3.3 Auction Theory in Computer Networks 3.3.1 Auction Basics 3.3.2 Auction Theory for Computer Networks 3.3.3 Basic Terminology in Auction Theory 3.4 Summary 4 Open-Cry Auction 4.1 4.2 4.3 4.4 English Auction 4.1.1 English Auction Process 4.1.2 Equilibrium Strategies Development of English Auction for Computer Networks 4.2.1 System Model and Problem Formulation 4.2.2 Walrasian Equilibrium 4.2.3 English Auction for Walrasian Equilibrium Dutch Auction 4.3.1 Dutch Auction Process 4.3.2 Revenue Equivalence Theorem 4.3.3 Equilibrium in Dutch Auction Development of Dutch Auction for Computer Networks 4.4.1 Prevention of Black Hole Attacks in Mobile Ad Hoc Networks 4.4.2 Relay Selection in the Internet of Things 4.4.3 Channel Allocation in 5G Heterogeneous Networks 72 72 72 74 78 79 81 82 83 83 85 86 87 87 91 93
Contents 4.5 4.6 5 First-Price Sealed-Bid Auction 5.1 5.2 5.3 5.4 5.5 6 Definition Equilibrium 5.2.1 Strategic Analysis 5.2.2 Bayesian-Nash Equilibrium First-Price Sealed-Bid Reverse Auction Development of First-Price Sealed-Bid Auction for Computer Networks 5.4.1 Incentive Mechanism for Data Aggregation 5.4.2 Market-Based Adaptive Task Allocation 5.4.3 Market-Based Relay Selection 5.4.4 Denial-of-Service Attack Prevention Summary 97 99 100 100 101 101 102 104 105 105 109 112 114 117 Second-Price Sealed-Bid Auction 1 19 6.1 119 119 121 123 6.2 6.3 7 English-Dutch Auction Summary IX Second-Price Sealed-Bid Auction 6.1.1 Definition 6.1.2 Dominant Strategy and Nash Equilibrium 6.1.3 Second-Price Sealed-Bid Reverse Auction 6.1.4 Development of Second-Price Sealed-Bid Auction for Computer Networks Vickrey-Clarke-Groves Auction 6.2.1 Definition 6.2.2 Description 6.2.3 Dominant Strategy 6.2.4 Examples 6.2.5 Virtues 6.2.6 Development of VCG Auction for Computer Networks Summary Combinatorial Auction 7.1 7.2 7.3 Introduction Substitutable and Complementary Items Single-Round Combinatorial Auction 7.3.1 Bidding Language 7.3.2 Winner Determination Problem 7.4 Iterative Combinatorial Auctions 7.4.1 Ascending Proxy Auction 7.4.2 Clock-Proxy Auction 7.5 Development of the Combinatorial Auction for Computer Networks 7.5.1 Spectrum Allocation in Cognitive Radio 7.5.2 Virtualization of 5G Massive MIMO 124 135 135 136 139 140 141 142 157 158 158 159 161 161 163 165 165 167 170 170 174
x Contents 8 7.5.3 Mobile Data Offloading in 5G HetNets 7.5.4 Resource Allocation in D2D Communication Underlying Cellular Networks 7.6 Summary 180 Double-Sided Auction 189 189 189 192 193 194 196 197 201 204 209 214 8.1 Introduction 8.2 Single-Round Double Auction 8.2.1 Uniform Pricing Policy 8.2.2 Discriminatory Pricing Policy 8.3 Continuous Double Auction 8.4 Development of Double Auction for Computer Networks 8.4.1 Sensing Task Allocation in Participatory Sensing 8.4.2 Location Privacy in Participatory Sensing 8.4.3 Spectrum Allocation in Heterogeneous Networks 8.4.4 Cloud Resource Allocation in Edge Computing 8.5 Summary 9 Other Auctions 9.1 9.2 9.3 9.4 9.5 10 Ascending Clock Auction 9.1.1 Auction Process 9.1.2 Application of Ascending Clock Auction for Physical Layer Security Share Auction Online Auction 9.3.1 Basic Terminologies 9.3.2 Development of Online Auction for Cloud Resource Pooling Waiting-Line Auction Summary 184 188 215 216 216 217 221 224 224 226 231 235 10.1 Optimal Auction 10.2 Machine Learning 10.3 Machine Learning for Optimal Auction 10.3.1 Design 10.3.2 Example 10.4 Machine Learning for Myerson Auction 10.4.1 Design 10.4.2 Example 10.5 Summary 236 236 238 239 239 244 249 250 254 259 References Index 260 27^ Optimal Auction Using Machine Learning
|
| adam_txt |
Contents 1 Introduction 1.1 1.2 1.3 1.4 2 A Brief Overview of the History of Auctions Auction Theory in Computer Networks Organization and Timeliness of This Book 1.3.1 Organization 1.3.2 Timeliness of the Book Acknowledgments page 1 1 2 3 3 7 10 Overview of Modern Computer Networks 11 2.1 11 11 12 14 15 16 18 18 20 21 22 24 25 26 27 29 30 31 33 34 34 35 37 38 Internet of Things 2.1.1 Definitions 2.1.2 IoT Architecture 2.1.3 Resources and Services of IoT 2.1.4 Wireless Sensor Network 2.1.5 Mobile Crowdsensing Network 2.2 Cloud Networking 2.2.1 General Architecture 2.2.2 Cloud Data Center Networking 2.2.3 Mobile Cloud Networking 2.2.4 Edge Computing 2.2.5 Cloud-Based Video-on-Demand System 2.3 5G Wireless Networks 2.3.1 Massive Multiple-Input and Multiple-Output 2.3.2 Heterogeneous Networks 2.3.3 Millimeter Wave Communications 2.3.4 Cognitive Radio 2.3.5 Device-to-Device Communications 2.3.6 Machine-to-Machine Communications 2.4 Data Collection and Resource Management 2.4.1 Data Aggregation 2.4.2 Task Allocation 2.4.3 User Association 2.4.4 Interference Management vii
Contents 3 2.4.5 Wireless Caching 2.4.6 Mobile Data Offloading 2.5 Wireless Network Security 2.5.1 Users and Attackers in Wireless Networks 2.5.2 Eavesdropping Attack 2.5.3 Denial-of-Service Attack 2.5.4 Information Security Issues 2.5.5 Illegitimate Behaviors in Wireless Networks 2.6 Summary 40 42 43 44 44 47 49 50 51 Mechanism Design and Auction Theory in Computer Networks 52 52 52 53 55 57 58 59 60 60 61 63 64 65 68 69 71 3.1 Mechanism Design 3.1.1 Mechanism 3.1.2 Mechanism Design 3.1.3 Revelation Principle 3.1.4 Incentive Compatibility 3.1.5 Individual Rationality 3.1.6 Economic Efficiency and Budget Balance 3.2 Optimal Mechanisms 3.2.1 Social Surplus and Profit 3.2.2 Social Surplus Maximization Problem 3.2.3 Profit Maximization Problem 3.3 Auction Theory in Computer Networks 3.3.1 Auction Basics 3.3.2 Auction Theory for Computer Networks 3.3.3 Basic Terminology in Auction Theory 3.4 Summary 4 Open-Cry Auction 4.1 4.2 4.3 4.4 English Auction 4.1.1 English Auction Process 4.1.2 Equilibrium Strategies Development of English Auction for Computer Networks 4.2.1 System Model and Problem Formulation 4.2.2 Walrasian Equilibrium 4.2.3 English Auction for Walrasian Equilibrium Dutch Auction 4.3.1 Dutch Auction Process 4.3.2 Revenue Equivalence Theorem 4.3.3 Equilibrium in Dutch Auction Development of Dutch Auction for Computer Networks 4.4.1 Prevention of Black Hole Attacks in Mobile Ad Hoc Networks 4.4.2 Relay Selection in the Internet of Things 4.4.3 Channel Allocation in 5G Heterogeneous Networks 72 72 72 74 78 79 81 82 83 83 85 86 87 87 91 93
Contents 4.5 4.6 5 First-Price Sealed-Bid Auction 5.1 5.2 5.3 5.4 5.5 6 Definition Equilibrium 5.2.1 Strategic Analysis 5.2.2 Bayesian-Nash Equilibrium First-Price Sealed-Bid Reverse Auction Development of First-Price Sealed-Bid Auction for Computer Networks 5.4.1 Incentive Mechanism for Data Aggregation 5.4.2 Market-Based Adaptive Task Allocation 5.4.3 Market-Based Relay Selection 5.4.4 Denial-of-Service Attack Prevention Summary 97 99 100 100 101 101 102 104 105 105 109 112 114 117 Second-Price Sealed-Bid Auction 1 19 6.1 119 119 121 123 6.2 6.3 7 English-Dutch Auction Summary IX Second-Price Sealed-Bid Auction 6.1.1 Definition 6.1.2 Dominant Strategy and Nash Equilibrium 6.1.3 Second-Price Sealed-Bid Reverse Auction 6.1.4 Development of Second-Price Sealed-Bid Auction for Computer Networks Vickrey-Clarke-Groves Auction 6.2.1 Definition 6.2.2 Description 6.2.3 Dominant Strategy 6.2.4 Examples 6.2.5 Virtues 6.2.6 Development of VCG Auction for Computer Networks Summary Combinatorial Auction 7.1 7.2 7.3 Introduction Substitutable and Complementary Items Single-Round Combinatorial Auction 7.3.1 Bidding Language 7.3.2 Winner Determination Problem 7.4 Iterative Combinatorial Auctions 7.4.1 Ascending Proxy Auction 7.4.2 Clock-Proxy Auction 7.5 Development of the Combinatorial Auction for Computer Networks 7.5.1 Spectrum Allocation in Cognitive Radio 7.5.2 Virtualization of 5G Massive MIMO 124 135 135 136 139 140 141 142 157 158 158 159 161 161 163 165 165 167 170 170 174
x Contents 8 7.5.3 Mobile Data Offloading in 5G HetNets 7.5.4 Resource Allocation in D2D Communication Underlying Cellular Networks 7.6 Summary 180 Double-Sided Auction 189 189 189 192 193 194 196 197 201 204 209 214 8.1 Introduction 8.2 Single-Round Double Auction 8.2.1 Uniform Pricing Policy 8.2.2 Discriminatory Pricing Policy 8.3 Continuous Double Auction 8.4 Development of Double Auction for Computer Networks 8.4.1 Sensing Task Allocation in Participatory Sensing 8.4.2 Location Privacy in Participatory Sensing 8.4.3 Spectrum Allocation in Heterogeneous Networks 8.4.4 Cloud Resource Allocation in Edge Computing 8.5 Summary 9 Other Auctions 9.1 9.2 9.3 9.4 9.5 10 Ascending Clock Auction 9.1.1 Auction Process 9.1.2 Application of Ascending Clock Auction for Physical Layer Security Share Auction Online Auction 9.3.1 Basic Terminologies 9.3.2 Development of Online Auction for Cloud Resource Pooling Waiting-Line Auction Summary 184 188 215 216 216 217 221 224 224 226 231 235 10.1 Optimal Auction 10.2 Machine Learning 10.3 Machine Learning for Optimal Auction 10.3.1 Design 10.3.2 Example 10.4 Machine Learning for Myerson Auction 10.4.1 Design 10.4.2 Example 10.5 Summary 236 236 238 239 239 244 249 250 254 259 References Index 260 27^ Optimal Auction Using Machine Learning |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Niyato, Dusit 1978- Luong, Nguyen Cong ca. 20./21. Jh Wang, Ping ca. 20./21. Jh Han, Zhu 1974- |
| author_GND | (DE-588)1077269730 (DE-588)1212077326 (DE-588)1212077628 (DE-588)1038496136 |
| author_facet | Niyato, Dusit 1978- Luong, Nguyen Cong ca. 20./21. Jh Wang, Ping ca. 20./21. Jh Han, Zhu 1974- |
| author_role | aut aut aut aut |
| author_sort | Niyato, Dusit 1978- |
| author_variant | d n dn n c l nc ncl p w pw z h zh |
| building | Verbundindex |
| bvnumber | BV046798120 |
| classification_rvk | ST 200 |
| classification_tum | DAT 250 MAT 920 |
| ctrlnum | (OCoLC)1193282765 (DE-599)BVBBV046798120 |
| dewey-full | 004.601/5193 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.601/5193 |
| dewey-search | 004.601/5193 |
| dewey-sort | 14.601 45193 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02827nam a2200601zc 4500</leader><controlfield tag="001">BV046798120</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220705 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">200708s2020 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108480765</subfield><subfield code="9">978-1-10848-076-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1193282765</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046798120</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.601/5193</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 250</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 920</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Niyato, Dusit</subfield><subfield code="d">1978-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1077269730</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Auction theory for computer networks</subfield><subfield code="c">Dusit Niyato (Nanyang Technological University), Nguyen Cong Luong (PHENIKAA University), Ping Wang (York University), Zhu Han (University of Houston</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, United Kingdom ; New York, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">x, 279 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 15 May 2020)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Auctions / Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Auctions / Computer programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Auction theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless communication systems</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Auktionstheorie</subfield><subfield code="0">(DE-588)4732699-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entität</subfield><subfield code="0">(DE-588)4629260-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dienstleistung</subfield><subfield code="0">(DE-588)4012178-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ressourcenallokation</subfield><subfield code="0">(DE-588)4129283-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Auktionstheorie</subfield><subfield code="0">(DE-588)4732699-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Ressourcenallokation</subfield><subfield code="0">(DE-588)4129283-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Dienstleistung</subfield><subfield code="0">(DE-588)4012178-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="6"><subfield code="a">Entität</subfield><subfield code="0">(DE-588)4629260-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="C">b</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Luong, Nguyen Cong</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1212077326</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Ping</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1212077628</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Han, Zhu</subfield><subfield code="d">1974-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1038496136</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-108-69107-9</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Regensburg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032206937&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032206937</subfield></datafield></record></collection> |
| id | DE-604.BV046798120 |
| illustrated | Illustrated |
| index_date | 2024-07-03T14:55:04Z |
| indexdate | 2024-07-10T08:54:07Z |
| institution | BVB |
| isbn | 9781108480765 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032206937 |
| oclc_num | 1193282765 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR DE-91G DE-BY-TUM DE-83 |
| owner_facet | DE-355 DE-BY-UBR DE-91G DE-BY-TUM DE-83 |
| physical | x, 279 Seiten Illustrationen, Diagramme |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Niyato, Dusit 1978- Verfasser (DE-588)1077269730 aut Auction theory for computer networks Dusit Niyato (Nanyang Technological University), Nguyen Cong Luong (PHENIKAA University), Ping Wang (York University), Zhu Han (University of Houston Cambridge, United Kingdom ; New York, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore Cambridge University Press 2020 x, 279 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Title from publisher's bibliographic system (viewed on 15 May 2020) Auctions / Mathematical models Auctions / Computer programs Auction theory Wireless communication systems Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Auktionstheorie (DE-588)4732699-2 gnd rswk-swf Entität (DE-588)4629260-3 gnd rswk-swf Dienstleistung (DE-588)4012178-1 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Ressourcenallokation (DE-588)4129283-2 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s Auktionstheorie (DE-588)4732699-2 s Ressourcenallokation (DE-588)4129283-2 s Datenverarbeitung (DE-588)4011152-0 s Dienstleistung (DE-588)4012178-1 s Netzwerk (DE-588)4171529-9 s Entität (DE-588)4629260-3 s b DE-604 Luong, Nguyen Cong ca. 20./21. Jh. Verfasser (DE-588)1212077326 aut Wang, Ping ca. 20./21. Jh. Verfasser (DE-588)1212077628 aut Han, Zhu 1974- Verfasser (DE-588)1038496136 aut Erscheint auch als Online-Ausgabe 978-1-108-69107-9 Digitalisierung UB Regensburg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032206937&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Niyato, Dusit 1978- Luong, Nguyen Cong ca. 20./21. Jh Wang, Ping ca. 20./21. Jh Han, Zhu 1974- Auction theory for computer networks Auctions / Mathematical models Auctions / Computer programs Auction theory Wireless communication systems Datenverarbeitung (DE-588)4011152-0 gnd Netzwerk (DE-588)4171529-9 gnd Auktionstheorie (DE-588)4732699-2 gnd Entität (DE-588)4629260-3 gnd Dienstleistung (DE-588)4012178-1 gnd Rechnernetz (DE-588)4070085-9 gnd Ressourcenallokation (DE-588)4129283-2 gnd |
| subject_GND | (DE-588)4011152-0 (DE-588)4171529-9 (DE-588)4732699-2 (DE-588)4629260-3 (DE-588)4012178-1 (DE-588)4070085-9 (DE-588)4129283-2 |
| title | Auction theory for computer networks |
| title_auth | Auction theory for computer networks |
| title_exact_search | Auction theory for computer networks |
| title_exact_search_txtP | Auction theory for computer networks |
| title_full | Auction theory for computer networks Dusit Niyato (Nanyang Technological University), Nguyen Cong Luong (PHENIKAA University), Ping Wang (York University), Zhu Han (University of Houston |
| title_fullStr | Auction theory for computer networks Dusit Niyato (Nanyang Technological University), Nguyen Cong Luong (PHENIKAA University), Ping Wang (York University), Zhu Han (University of Houston |
| title_full_unstemmed | Auction theory for computer networks Dusit Niyato (Nanyang Technological University), Nguyen Cong Luong (PHENIKAA University), Ping Wang (York University), Zhu Han (University of Houston |
| title_short | Auction theory for computer networks |
| title_sort | auction theory for computer networks |
| topic | Auctions / Mathematical models Auctions / Computer programs Auction theory Wireless communication systems Datenverarbeitung (DE-588)4011152-0 gnd Netzwerk (DE-588)4171529-9 gnd Auktionstheorie (DE-588)4732699-2 gnd Entität (DE-588)4629260-3 gnd Dienstleistung (DE-588)4012178-1 gnd Rechnernetz (DE-588)4070085-9 gnd Ressourcenallokation (DE-588)4129283-2 gnd |
| topic_facet | Auctions / Mathematical models Auctions / Computer programs Auction theory Wireless communication systems Datenverarbeitung Netzwerk Auktionstheorie Entität Dienstleistung Rechnernetz Ressourcenallokation |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032206937&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT niyatodusit auctiontheoryforcomputernetworks AT luongnguyencong auctiontheoryforcomputernetworks AT wangping auctiontheoryforcomputernetworks AT hanzhu auctiontheoryforcomputernetworks |