Truthful Mechanisms for Combinatorial Allocation of Electric Power in Alternating Current Electric Systems for Smart Grid
Chi-Kin Chau, Khaled Elbassioni, Majid Khonji

TL;DR
This paper develops truthful approximation algorithms for complex-demand knapsack problems in smart grid power allocation, addressing quadratic constraints and extending previous results with new PTAS and FPTAS solutions.
Contribution
It introduces a comprehensive study of the complex-demand knapsack problem with truthful mechanisms, providing the first PTAS and FPTAS for different demand phase ranges.
Findings
Provides a truthful PTAS for demand phase b8a0b4;
Offers a truthful FPTAS that nearly optimizes the objective;
Shows hardness results preventing PTAS for certain phase ranges.
Abstract
Traditional studies of combinatorial auctions often only consider linear constraints. The rise of smart grid presents a new class of auctions, characterized by quadratic constraints. This paper studies the {\em complex-demand knapsack problem}, in which the demands are complex valued and the capacity of supplies is described by the magnitude of total complex-valued demand. This naturally captures the power constraints in alternating current (AC) electric systems. In this paper, we provide a more complete study and generalize the problem to the multi-minded version, beyond the previously known -approximation algorithm for only a subclass of the problem. More precisely, we give a truthful PTAS for the case , and a truthful FPTAS, which {\it fully} optimizes the objective function but violates the capacity constraint by at most ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
