Home > Research > Publications & Outputs > An auction algorithm for procuring wireless cha...

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

An auction algorithm for procuring wireless channel in a heterogenous wireless network

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

An auction algorithm for procuring wireless channel in a heterogenous wireless network. / Suri, Neeraj; Narahari, Y.
2006 IFIP International Conference on Wireless and Optical Communications Networks. IEEE, 2006.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Suri, N & Narahari, Y 2006, An auction algorithm for procuring wireless channel in a heterogenous wireless network. in 2006 IFIP International Conference on Wireless and Optical Communications Networks. IEEE. https://doi.org/10.1109/WOCN.2006.1666541

APA

Suri, N., & Narahari, Y. (2006). An auction algorithm for procuring wireless channel in a heterogenous wireless network. In 2006 IFIP International Conference on Wireless and Optical Communications Networks IEEE. https://doi.org/10.1109/WOCN.2006.1666541

Vancouver

Suri N, Narahari Y. An auction algorithm for procuring wireless channel in a heterogenous wireless network. In 2006 IFIP International Conference on Wireless and Optical Communications Networks. IEEE. 2006 doi: 10.1109/WOCN.2006.1666541

Author

Suri, Neeraj ; Narahari, Y. / An auction algorithm for procuring wireless channel in a heterogenous wireless network. 2006 IFIP International Conference on Wireless and Optical Communications Networks. IEEE, 2006.

Bibtex

@inproceedings{fb4f51b94f444249b549c0bcd5b079bf,
title = "An auction algorithm for procuring wireless channel in a heterogenous wireless network",
abstract = "In this paper, we develop a novel auction algorithm for procuring wireless channel by a wireless node in a heterogeneous wireless network. We assume that the service providers of the heterogeneous wireless network are selfish and non-cooperative in the sense that they are only interested in maximizing their own utilities. The wireless user needs to procure wireless channels to execute multiple tasks. To solve the problem of the wireless user, we propose a reverse optimal (REVOPT) auction and derive an expression for the expected payment by the wireless user, The proposed auction mechanism REVOPT satisfies important game theoretic properties such as Bayesian incentive compatibility and individual rationality. {\textcopyright}2006 IEEE.",
keywords = "Bayesian incentive compatibility, Game theory, Heterogeneous wireless network, Individual rationality, Mechanism design, Optimal auction mechanisms, Rationality, Selfishness, Algorithms, Bayesian networks, Communication channels (information theory), Telecommunication links, Heterogeneous wireless networks, Reverse optimal auction, Wireless networks",
author = "Neeraj Suri and Y. Narahari",
year = "2006",
month = apr,
day = "11",
doi = "10.1109/WOCN.2006.1666541",
language = "English",
isbn = "1424403405",
booktitle = "2006 IFIP International Conference on Wireless and Optical Communications Networks",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - An auction algorithm for procuring wireless channel in a heterogenous wireless network

AU - Suri, Neeraj

AU - Narahari, Y.

PY - 2006/4/11

Y1 - 2006/4/11

N2 - In this paper, we develop a novel auction algorithm for procuring wireless channel by a wireless node in a heterogeneous wireless network. We assume that the service providers of the heterogeneous wireless network are selfish and non-cooperative in the sense that they are only interested in maximizing their own utilities. The wireless user needs to procure wireless channels to execute multiple tasks. To solve the problem of the wireless user, we propose a reverse optimal (REVOPT) auction and derive an expression for the expected payment by the wireless user, The proposed auction mechanism REVOPT satisfies important game theoretic properties such as Bayesian incentive compatibility and individual rationality. ©2006 IEEE.

AB - In this paper, we develop a novel auction algorithm for procuring wireless channel by a wireless node in a heterogeneous wireless network. We assume that the service providers of the heterogeneous wireless network are selfish and non-cooperative in the sense that they are only interested in maximizing their own utilities. The wireless user needs to procure wireless channels to execute multiple tasks. To solve the problem of the wireless user, we propose a reverse optimal (REVOPT) auction and derive an expression for the expected payment by the wireless user, The proposed auction mechanism REVOPT satisfies important game theoretic properties such as Bayesian incentive compatibility and individual rationality. ©2006 IEEE.

KW - Bayesian incentive compatibility

KW - Game theory

KW - Heterogeneous wireless network

KW - Individual rationality

KW - Mechanism design

KW - Optimal auction mechanisms

KW - Rationality

KW - Selfishness

KW - Algorithms

KW - Bayesian networks

KW - Communication channels (information theory)

KW - Telecommunication links

KW - Heterogeneous wireless networks

KW - Reverse optimal auction

KW - Wireless networks

U2 - 10.1109/WOCN.2006.1666541

DO - 10.1109/WOCN.2006.1666541

M3 - Conference contribution/Paper

SN - 1424403405

BT - 2006 IFIP International Conference on Wireless and Optical Communications Networks

PB - IEEE

ER -