A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Filters
Equitable Cost Allocations via Primal–Dual-Type Algorithms
2008
SIAM journal on computing (Print)
EQUITABLE COST SHARING
METHODS
Ä Ø Õ Ò Ö
Ò¹ Ñ Ò× ÓÒ Ð Ú ØÓÖ× Û Ø ÒÓÒÒ Ø Ú
ÓÓÖ Ò Ø ×º Ï Û ÐÐ ÒÓØ Ý Õ ÁAE Ø Ú ØÓÖ Ó Ø Ò
Ý ×ÓÖØ Ò Ø ÓÑÔÓÒ ÒØ× Ó Õ Ò ÒÖ × Ò ÓÖ Öº Ì Ù×
Õ ÁAE ´ µ Õ ÁAE ´ · ½µ¸ ÓÖ ½ ...
THE ALGORITHM Ï ÒÓÛ ÔÖ × ÒØ ÔÖ Ñ Ð¹ ٠йØÝÔ Ð ÓÖ Ø Ñ ÓÖ Ó Ø Ò¹ Ò Ë ÓÖ ÒÝ × Ø Ëº Öר ×ÓÑ ¬Ò Ø ÓÒ׺ Ä Ø Ü Ë Ê · ÓÖÓÐÐ ÖÝ ¿º Á Óר × ×Ù ÑÓ ÙÐ Ö Ò Ü × × Ð ÓÖ Ë¸Ø Ò Ø Ö × ÙÒ ÕÙ Ñ Ü Ñ Ð Ø Ø × Øº ÁØ × Ú Ò Ý ¾ ...
doi:10.1137/060658448
fatcat:okye6wbzcnbkzktslle2r2hs4q
Group Strategyproof Multicast in Wireless Networks
2011
IEEE Transactions on Parallel and Distributed Systems
To answer the question whether constant-ratio cost recovery is possible, we further apply a primaldual schema to simultaneously build a routing solution and a cost sharing scheme, and prove that the resulting ...
mechanism is group strategyproof and guarantees 1 4 -approximate cost recovery against an optimal routing scheme. ...
for equitable and fair allocation of goods. ...
doi:10.1109/tpds.2010.184
fatcat:wycoi3sdendzli52cyoptem4re
CFLMEC: Cooperative Federated Learning for Mobile Edge Computing
[article]
2021
arXiv
pre-print
in which establishes a primal-dual learning framework and batch gradient decent to learn the dynamic network with outdated information and predict the sub-channel condition. ...
, and interference aware communication resource allocation algorithm for less reliance on edge servers (LRs) in D2D link. ...
In CFLMEC, we use a decomposition approach to solve the problem by considering maximum data rate on sub-channel, channel reuse and wireless resource allocation in which establish a primal-dual learning ...
arXiv:2102.10591v1
fatcat:y4woc4t3incqhp7swsczqviwim
A computational evaluation of a general branch-and-price framework for capacitated network location problems
2008
Annals of Operations Research
We consider several different network location models, by combining cardinality constraints, fixed set-up costs, concentrator restrictions and regional constraints. ...
costs and allocation costs, then it makes sense to compare the optimal CPMP solution value with the contribution of the allocation costs to the optimal CARD+FIX solution value. ...
Primal heuristics In order to find good feasible solutions early in the search tree, we integrated two primal heuristics in the main algorithm. ...
doi:10.1007/s10479-008-0375-5
fatcat:bwt24yyl7jbulav374lkvolhyu
Bandwidth and routing optimization in wireless cellular networks with relays
2009
2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
frequency tone, form a simultaneous routing, frequency planning, and power allocation problem. ...
This paper presents a dual decomposition approach to this problem and illustrates that while the use of relays does not necessarily increase the total cell throughput, it significantly improves the minimum ...
Fortunately, nonconvex constraint of this type can be handled efficiently for the OFDM optimization problem via dual decomposition due to the following result in [18] - [20] . ...
doi:10.1109/wiopt.2009.5291613
dblp:conf/wiopt/JiY09
fatcat:zwfvhdds75cvnn4k4wtx3erf7a
The Cloudlet Bazaar Dynamic Markets for the Small Cloud
[article]
2018
arXiv
pre-print
The recent emergence of the small cloud (SC), both in concept and in practice, has been driven mainly by issues related to service cost and complexity of commercial cloud providers (e.g., Amazon) employing ...
is the Primal-Dual Interior Point Method [26] . ...
Dual Problem Formulation -We will solve OPT using the primal-dual approach [26] . ...
arXiv:1704.00845v2
fatcat:ymjfemj345c47o57kurqtgawfq
Utility Maximization for Single-Station User Association in Downlink Cellular Networks
[article]
2015
arXiv
pre-print
The general SSA NUM problem involves choosing an optimal association from MUs to BSs as well as an optimal allocation of BS resources to associated MUs. ...
Our contributions are as follows: i) we give an explicit solution for the optimal BS allocation for a given SSA, which establishes SSA NUM as a purely combinatiorial problem; ii) we establish the integrality ...
The authors relax the combinatorial SSA problem and obtain a primal-dual algorithm and prove it converges to the solution of the relaxation. ...
arXiv:1510.06110v1
fatcat:z6766y64prg7zpcoc2x4a4o4he
Resources Allocation for Distributed Systems: A Review
2021
Zenodo
in cloud computing, Direction Method of Multipliers (ADMM) algorithm for SDN Networking, FFR algorithm application in cellular network, Fairness-based Distributed Resource Allocation (FDRA) algorithm ...
In this paper many resource allocation algorithms in different environment and area that mentioned before are reviewed, compared and summarized. for instance, Cloud-based computation algorithm implementations ...
(Deng et al., 2019) 2019 Sub gradient-based algorithm Achieving resource allocation in heterogeneous network Strong convex cost function and Wightbalanced diagraphs (Fu et al., 2019) 2019 Primal-dual ...
doi:10.5281/zenodo.4462087
fatcat:co2led6hybgmjoeeagghdx3jjq
Algorithms for the continuous nonlinear resource allocation problem---new implementations and numerical studies
[article]
2015
arXiv
pre-print
Third, it numerically evaluates several relaxation (primal) and breakpoint (dual) algorithms, incorporating a variety of pegging strategies, as well as a quasi-Newton method. ...
Patriksson (2008) provided a then up-to-date survey on the continuous,separable, differentiable and convex resource allocation problem with a single resource constraint. ...
LUSS, Equitable Resource Allocation: Models, Algorithms and Applications, Chapter 2: Nonlinear Resource Allocation (Problem) φ j strictly convex; g j (x j ) = x j This book extends the resource allocation ...
arXiv:1501.07035v1
fatcat:3fprcbll6nehrdgbddi3e7eyse
Uplink resource allocation in cooperative OFDMA with multiplexing mobile relays
2016
EURASIP Journal on Wireless Communications and Networking
Mobile relays can offer better results than fixed relays without any additional infrastructure cost. ...
Simulation results show that these proposed algorithms both reduce system's power consumption while ensuring the required QoS. ...
In [20] , joint resource allocation is considered for uplink system where relays are fixed. It is solved via an iterative algorithm based on dual decomposition theory. ...
doi:10.1186/s13638-016-0704-3
fatcat:bq6wmi3t4bgfjpuf7rknvyby7m
Matching Markets
[article]
2021
arXiv
pre-print
Although it has been shown that finding market clearing prices for Fisher markets with indivisible goods is NP-hard, there exist polynomial-time algorithms able to compute these prices and allocations ...
Matching markets are of particular interest in computer science and economics literature as they are often used to model real-world phenomena where we aim to equitably distribute a limited amount of resources ...
Vazirani (citeV07) provides a weakly polynomial-time algorithm for finding equilibrium prices and allocation for Fisher markets employing linear utilities by using primal-dual schema.It uses the assumption ...
arXiv:2109.14850v1
fatcat:3pr6m5nspffcflqilvygzeryay
Frequency Regulation with Heterogeneous Energy Resources: A Realization using Distributed Control
[article]
2021
arXiv
pre-print
Actuation commands for the test devices are obtained by solving an economic dispatch problem at every regulation instant using distributed ratio-consensus, primal-dual, and Newton-like algorithms. ...
The distributed control setup consists of a set of Raspberry Pi end-points exchanging messages via an ethernet switch. ...
Primal-Dual (PD): Both this dynamics and DANA (described next) take into account the cost functions of the DER types when computing the power setpoints, i.e., f i are nonconstant. ...
arXiv:2007.07971v4
fatcat:jm7wd77mhbewbaayqfos63plue
Matchings in connection with ground delay program planning
2009
Networks
Equitable Allocation Many challenges exist in measuring equity of allocations. ...
To show that the resulting solution yields an optimal primal-dual pair, we first note that the complementary slackness conditions hold, that is, y i = 1 ⇒ u i = T (f i ) + w, x ij = 1 ⇒ u i = T (s j ) ...
doi:10.1002/net.20272
fatcat:mqpjehgqr5ckpks6ucrvvsri54
Matchings in Connection with Ground Delay Program Planning
2006
Social Science Research Network
Equitable Allocation Many challenges exist in measuring equity of allocations. ...
To show that the resulting solution yields an optimal primal-dual pair, we first note that the complementary slackness conditions hold, that is, y i = 1 ⇒ u i = T (f i ) + w, x ij = 1 ⇒ u i = T (s j ) ...
doi:10.2139/ssrn.939567
fatcat:ibnorhhvybcpbm7gnjwmrwwzva
Algorithmic Cost Allocation Games: Theory and Applications
[chapter]
2012
Operations Research Proceedings
This thesis combines cooperative game theory and state-ofthe-art algorithms from linear and integer programming in order to define fair cost allocations and calculate them numerically for large real-world ...
Our approaches outclasse traditional cost allocation methods in terms of fairness and users' satisfaction. ...
If it is not the case, then the constraint (4.4) cannot be treated explicitly, but only via constraint generation. The following algorithm calculates primal and dual optimal solutions of (4.2). ...
doi:10.1007/978-3-642-29210-1_95
dblp:conf/or/Hoang11
fatcat:5xe5xauam5g4fgcck3vedhfdr4
« Previous
Showing results 1 — 15 out of 124 results