We define a family of rules for dividing m indivisible goods among agents, parameterized by a scoring vector and a social welfare aggregation function. We assume that agents’ preferences over sets of goods are additive, but that the input is ordinal: each agent reports her preferences simply by ranking single goods. Similarly to positional scoring rules in voting, a scoring vector \(s = (s_1, \ldots , s_m)\) consists of m nonincreasing, nonnegative weights, where \(s_i\) is the score of a good assigned to an agent who ranks it in position i. The global score of an allocation for an agent is the sum of the scores of the goods assigned to her. The social welfare of an allocation is the aggregation of the scores of all agents, for some aggregation function \(\star \) such as, typically, \(+\) or \(\min \). The rule associated with s and \(\star \) maps a profile to (one of) the allocation(s) maximizing social welfare. After defining this family of rules, and focusing on some key examples, we investigate some of the social-choice-theoretic properties of this family of rules, such as various kinds of monotonicity, and separability. Finally, we focus on the computation of winning allocations, and on their approximation: we show that for commonly used scoring vectors and aggregation functions this problem is NP-hard and we exhibit some tractable particular cases.
24 March 2023 in IEEE Transactions on Vehicular Technology
We investigate secure communications for a rate-splitting multiple access (RSMA) system. In particular, a jamming-based covert communication (CC) technique is used to effectively prevent a warden from detecting the data communications. As the jamming signals also degrades the data rate of the users, we formulate an optimization problem that maximizes the minimum data rate over all the users subject to the constraints on the security requirement and power budgets of the transmitter and optimize the data rate, transmit power, and jamming power. The max-min problem is non-convex, and we propose a fast exponential algorithm which can produce a global optimal solution to the problem. The simulation results show that our proposed algorithm outperforms the sequential quadratic programming algorithm, a powerful algorithmic tool for solving nonlinear optimization problems, in terms of min-rate and execution time (for a small number of users), given the same security requirement. Additionally, it is observed through simulation that RSMA can achieve up to three times better than non-orthogonal multiple access (NOMA) in terms of min-rate.
Our ever-increasing reliance on electricity coupled with inefficient consumption has resulted in several economical and environmental threats. To curb these threats, smart grids are emerging. These improved power systems could potentially reduce the peak consumption and better match demand to supply, to produce both economical and environmental advantages. In this work, we consider two pricing problems in the smart grid, under a dynamic pricing model, where consumers follow threshold policies to schedule their power consumption. The first problem is to set the prices during the different time periods such that the peak demand is minimized. The second problem is to set the prices such that the power demand matches the supply. Firstly, we propose generic heuristics called GREEDY and SLIDING-WINDOW that are able to solve the two studied problems in addition to any other optimization problem, under the same model. Secondly, we provide theoretical analysis for the uniform-pricing approach in the context of peak-demand minimization. In addition, we propose optimal algorithms for the two optimization problems that can be used when the maximum deadline period of the power jobs is relatively small. Moreover, we conduct several experiments to evaluate the proposed algorithms and the uniform pricing approach on real data. Our experimental results showed that our proposed heuristics have a relatively low approximation ratio, and have the potential to provide a significant energy saving in many cases compared to the Time-of-Use (ToU) pricing. Furthermore, the experiments showed that while the uniform pricing has an acceptable approximation ratio in the average case, it leads to energy loss compared to the ToU pricing. Finally, the experiments demonstrated a tradeoff between optimality and speed.
26 June 2018 in Autonomous Agents and Multi-Agent Systems
We consider a rate-splitting multiple access (RSMA)-based communication and radar coexistence (CRC) system. The proposed system allows an RSMA-based communication system to share spectrum with multiple radars, which significantly improves spectral efficiency, energy efficiency and quality of service (QoS) of communication users (CUs). Due to the spectrum sharing, the communication network and the radars cause interference to each other, which reduces the signal-to-interference-plus-noise ratio (SINR) of the radars as well as the data rate of the CUs. Therefore, a major problem is to maximize the sum rate of the CUs while guaranteeing their QoS requirements of data transmissions and the SINR requirements of multiple radars. To achieve the objective, we formulate a new problem that optimizes i) common rates of the CUs, ii) transmit power of the common message of the CUs, iii) transmit power of the private messages for the intended CUs, and iv) transmit power of the radar systems. The problem is non-convex, and thus we propose two algorithms. The first sequential quadratic programming (SQP) as the state-of-the-art in nonlinear programming method can quickly return a local optimal solution. The second is an additive approximation scheme (AAS) which solves the problem globally in a reasonable amount of time. Simulation results show the significant improvement of the AAS compared with the SQP in terms of sum rate. Furthermore, with the AAS, the sum rate of the CUs only slightly decreases when the radars' SINR is significantly increased. This implies that the AAS supports the RSMA-based communication system which allows to well coexist with the radars.