Conference paper · 2018

An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems

Tayebeh Bahreini, Hossein Badri, Daniel Grosu

IEEE/ACM Symposium on Edge Computing (SEC), 313–322 · Published 1 October 2018 · DOI 10.1109/sec.2018.00030

View at the publisherCite this paper

In brief

“An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems” is a 2018 conference paper by Tayebeh Bahreini and 2 co-authors, published in IEEE/ACM Symposium on Edge Computing (SEC). OpenAlex counts 66 citations as of 19 November 2026, which puts it in the top 9% of works published in 2018 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
66
Most cited in
2021 (14)
Field-weighted impact
4.99
References
30
Authors
3

Abstract

One of the major challenges in Mobile Edge Computing~(MEC) systems is to decide how to allocate and price edge/cloud resources so that a given system's objective, such as revenue or social welfare, is optimized. One promising approach is to allocate these resources based on auction models, in which users place bids for using a certain… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Bahreini, T., Badri, H., & Grosu, D. (2018). An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems. IEEE/ACM Symposium on Edge Computing (SEC), 313–322. https://doi.org/10.1109/sec.2018.00030

MLA 9

Bahreini, Tayebeh, et al. “An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems.” IEEE/ACM Symposium on Edge Computing (SEC), 2018, pp. 313–322. https://doi.org/10.1109/sec.2018.00030.

Chicago

Bahreini, Tayebeh, Hossein Badri, and Daniel Grosu. 2018. “An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems.” IEEE/ACM Symposium on Edge Computing (SEC): 313–322. https://doi.org/10.1109/sec.2018.00030.

Harvard

Bahreini, T., Badri, H. and Grosu, D. (2018) ‘An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems’, IEEE/ACM Symposium on Edge Computing (SEC), pp. 313–322. doi:10.1109/sec.2018.00030.

IEEE

T. Bahreini, H. Badri, and D. Grosu, “An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems,” IEEE/ACM Symposium on Edge Computing (SEC), pp. 313–322, 2018, doi: 10.1109/sec.2018.00030.

BibTeX

@inproceedings{bahreini2018envy,
  title     = {{An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems}},
  author    = {Bahreini, Tayebeh and Badri, Hossein and Grosu, Daniel},
  booktitle = {IEEE/ACM Symposium on Edge Computing (SEC)},
  year      = {2018},
  pages     = {313--322},
  doi       = {10.1109/sec.2018.00030},
  url       = {https://doi.org/10.1109/sec.2018.00030}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201966
202088
20211414
20221111
202399
202499
202577
202622

Its field-weighted citation impact is 4.99: it has been cited 4.99 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing

  • envy-free allocation
  • auction mechanisms
  • resource allocation
  • edge computing
  • mobile edge computing
  • resource pricing
  • position auctions
  • combinatorial auctions

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Bahreini, T., Badri, H., & Grosu, D. (2018). An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems. IEEE/ACM Symposium on Edge Computing (SEC), 313–322. https://doi.org/10.1109/sec.2018.00030

How many times has this paper been cited?

66 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Tayebeh Bahreini, Hossein Badri, Daniel Grosu.

What is the DOI of this paper?

10.1109/sec.2018.00030, permanently at https://doi.org/10.1109/sec.2018.00030. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.