Rakesh V. Vohra

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Junjik Bae

> Home > Persons > Rakesh V. Vohra

Publications

2009
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/gamenets/BaeBBHV09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gamenets/BaeBBHV09
Junjik Bae, Eyal Beigman, Randall Berry, Michael L. Honig, Rakesh Vohra:
On the efficiency of sequential auctions for spectrum sharing. GAMENETS 2009: 199-205
2008
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/jsac/BaeBBHV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsac/BaeBBHV08
Junjik Bae, Eyal Beigman, Randall A. Berry, Michael L. Honig, Rakesh V. Vohra:
Sequential Bandwidth and Power Auctions for Distributed Spectrum Sharing. IEEE J. Sel. Areas Commun. 26(7): 1193-1203 (2008)
2007
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/cdc/BaeBBHV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cdc/BaeBBHV07
Junjik Bae, Eyal Beigman, Randall Berry, Michael L. Honig, Rakesh V. Vohra:
Efficiency bounds for sequential resource allocation auctions. CDC 2007: 765-770
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/crowncom/BaeBBHV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crowncom/BaeBBHV07
Junjik Bae, Eyal Beigman, Randall Berry, Michael L. Honig, Rakesh Vohra:
Efficiency of Sequential Bandwidth and Power Auctions With Rate Utilities. CrownCom 2007: 434-440

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.