paper-with-me

홈 › Papers

MOHAF: A Multi-Objective Hierarchical Auction Framework for Scalable and Fair Resource Allocation in IoT Ecosystems

2025-08-20 · Kushagra Agrawal, Polat Goktas, Anjan Bandopadhyay, Debolina Ghosh, Junali Jasmine Jena, Mahendra Kumar Gourisaria arxiv

The rapid growth of Internet of Things (IoT) ecosystems has intensified the challenge of efficiently allocating heterogeneous resources in highly dynamic, distributed environments. Conventional centralized mechanisms and single-objective auction models, focusing solely on metrics such as cost minimization or revenue maximization, struggle to deliver balanced system performance. This paper proposes the Multi-Objective Hierarchical Auction Framework (MOHAF), a distributed resource allocation mechanism that jointly optimizes cost, Quality of Service (QoS), energy efficiency, and fairness. MOHAF integrates hierarchical clustering to reduce computational complexity with a greedy, submodular optimization strategy that guarantees a (1-1/e) approximation ratio. A dynamic pricing mechanism adapts in real time to resource utilization, enhancing market stability and allocation quality. Extensive experiments on the Google Cluster Data trace, comprising 3,553 requests and 888 resources, demonstrate MOHAF's superior allocation efficiency (0.263) compared to Greedy (0.185), First-Price (0.138), and Random (0.101) auctions, while achieving perfect fairness (Jain's index = 1.000). Ablation studies reveal the critical influence of cost and QoS components in sustaining balanced multi-objective outcomes. With near-linear scalability, theoretical guarantees, and robust empirical performance, MOHAF offers a practical and adaptable solution for large-scale IoT deployments, effectively reconciling efficiency, equity, and sustainability in distributed resource coordination.

📄 PDF Abstract BibTeX arXiv:2508.14830

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A3M: Adaptive, Adversarial and Multi-Objective Learning for Strategic Bidding in Repeated Auctions

2026-06-27 · Junhan Li, Yuxin Zhang, Haoran Wang, Minghao Chen arxiv

Learning to bid in repeated multi-unit auctions with bandit feedback poses a fundamental challenge. Existing methods often rely on rigid explore-then-exploit schedules, assume stationary adversaries, and optimize solely …

Reinforcement Learning

Multi-Session Budget Optimization for Forward Auction-based Federated Learning

2023-11-21 · Xiaoli Tang, Han Yu

Auction-based Federated Learning (AFL) has emerged as an important research field in recent years. The prevailing strategies for FL model users (MUs) assume that the entire team of the required data owners (DOs) for an F…

Federated LearningHierarchical Reinforcement Learning

Automated Deterministic Auction Design with Objective Decomposition

2024-02-19 · Zhijian Duan, Haoran Sun, Yichong Xia, Siqiang Wang 외

Identifying high-revenue mechanisms that are both dominant strategy incentive compatible (DSIC) and individually rational (IR) is a fundamental challenge in auction design. While theoretical approaches have encountered b…

Implementing a Hierarchical Deep Learning Approach for Simulating Multi-Level Auction Data

2022-07-25 · Igor Sadoune, Andrea Lodi, Marcelin Joanis

We present a deep learning solution to address the challenges of simulating realistic synthetic first-price sealed-bid auction data. The complexities encountered in this type of auction data include high-cardinality disc…

Density Estimation

Objective Variables for Probabilistic Revenue Maximization in Second-Price Auctions with Reserve

2015-06-24 · Maja R. Rudolph, Joseph G. Ellis, David M. Blei

Many online companies sell advertisement space in second-price auctions with reserve. In this paper, we develop a probabilistic method to learn a profitable strategy to set the reserve price. We use historical auction da…

Decision Makingregression