scholarly journals Efficient Black-Box Reductions for Separable Cost Sharing

Author(s):  
Tobias Harks ◽  
Martin Hoefer ◽  
Anja Schedel ◽  
Manuel Surek

In cost-sharing games with delays, a set of agents jointly uses a subset of resources. Each resource has a fixed cost that has to be shared by the players, and each agent has a nonshareable player-specific delay for each resource. A separable cost-sharing protocol determines cost shares that are budget-balanced, separable, and guarantee existence of pure Nash equilibria (PNE). We provide black-box reductions reducing the design of such a protocol to the design of an approximation algorithm for the underlying cost-minimization problem. In this way, we obtain separable cost-sharing protocols in matroid games, single-source connection games, and connection games on n-series-parallel graphs. All these reductions are efficiently computable - given an initial allocation profile, we obtain a cheaper profile and separable cost shares turning the profile into a PNE. Hence, in these domains, any approximation algorithm yields a separable cost-sharing protocol with price of stability bounded by the approximation factor.

Author(s):  
Smita Parija ◽  
Sudhansu Sekhar Singh ◽  
Swati Swayamsiddha

Location management is a very critical and intricate problem in wireless mobile communication which involves tracking the movement of the mobile users in the cellular network. Particle Swarm Optimization (PSO) is proposed for the optimal design of the cellular network using reporting cell planning (RCP) strategy. In this state-of-the-art approach, the proposed algorithm reduces the involved total cost such as location update and paging cost for the location management issue. The same technique is proved to be a competitive approach to different existing test network problems showing the efficacy of the proposed method through simulation results. The result obtained is also validated for real network data obtained from BSNL, Odisha. Particle Swarm Optimization is used to find the optimal set of reporting cells in a given cellular network by minimizing the location management cost. This RCP technique applied to this cost minimization problem has given improved result as compared to the results obtained in the previous literature.


FLORESTA ◽  
2002 ◽  
Vol 32 (1) ◽  
Author(s):  
Pedro Giovani Lacowicz ◽  
Ricardo Berger ◽  
Romano Timofeiczyk Júnior ◽  
João Carlos Garzel Leodoro Da Silva

Este trabalho tratou da minimização dos custos do transporte rodoviário florestal, através da programação linear inteira e otimização dos tempos de ciclo de transporte. Após a obtenção dos dados de uma empresa florestal, foram elaborados três cenários, quais sejam: Cenário I: levantamento do quadro atual da empresa, como subsídio comparativo após a racionalização e otimização das etapas que mais consomem tempo do ciclo; Cenário II: realizada em função do uso da programação linear, juntamente com a racionalização dos tempos de fila de espera para carga e descarga; Cenário III: além da programação linear e racionalização dos tempos de espera em fila, utilizou-se, paralelamente, uma otimização do tempo de carga e uma elevação da velocidade de transporte. Os resultados mostraram-se significativos, onde a racionalização e a otimização contribuíram para a redução no número de caminhões e do custo total, traduzindo-se em aumentos na produção dos veículos, na receita bruta e líquida dos freteiros. Cost Minimization of Forest Road Transport by Using the Integer Linear Program and Transport Cycle Time Optimization Abstract This study was about the decreasent of the costs of forest road transport, using the integer linear program and transport cycle time optimization. After obtaining all of the costs, consumed time and the current company picture, a total of three evaluations were done and are described below in settings. Setting I: The current company picture data was calculated as a comparative subsidy following the racionalization and optimization stages that are more time-consuming in the transport cycle. Setting II: This evaluation was done in terms of linear programation use, together with the loading and unloading waiting in line time racionalization. Setting III: In this evaluation, besides the linear programation use and waiting in line time racionalization, it was simultaneously used a time optimization and a foster transport speed. The acquired results were very meaningful, while the racionalization and optimization happened, the trucks rate and total cost successively decreased, resulting in better vehicles performance, and consequently, an increase in the gross and net drivers’ income. Even though there was a costs decrease and an outsiders’ income increase, wich was not enough to pay their total costs, that is, only the variable ones were totally paid and part of the outsiders’ fixed cost.


2010 ◽  
Vol 11 (03n04) ◽  
pp. 97-120 ◽  
Author(s):  
VITTORIO BILÒ

We consider the problem of sharing the cost of multicast transmissions in non-cooperative undirected networks where a set of receivers R wants to be connected to a common source s. The set of choices available to each receiver r ∈ R is represented by the set of all (s, r)-paths in the network. Given the choices performed by all the receivers, a public known cost sharing method determines the cost share to be charged to each of them. Receivers are selfish agents aiming to obtain the transmission at the minimum cost share and their interactions create a non-cooperative game. Devising cost sharing methods yielding games whose price of anarchy (price of stability), defined as the worst-case (best-case) ratio between the cost of a Nash equilibrium and that of an optimal solution, is not too high is thus of fundamental importance in non-cooperative network design. Moreover, since cost sharing games naturally arise in socio-economical contests, it is convenient for a cost sharing method to meet some constraining properties. In this paper, we first define several such properties and analyze their impact on the prices of anarchy and stability. We also reconsider all the methods known so far by classifying them according to which properties they satisfy and giving the first non-trivial lower bounds on their price of stability. Finally, we propose a new method, namely the free-riders method, which admits a polynomial time algorithm for computing a pure Nash equilibrium whose cost is at most twice the optimal one. Some of the ideas characterizing our approach have been independently proposed in Ref. 10.


2013 ◽  
Vol 4 (4) ◽  
pp. 1-22
Author(s):  
Zrinka Lukač ◽  
Manuel Laguna

The recent development in network multimedia technology has created numerous real-time multimedia applications where the Quality-of-Service (QoS) requirements are quite rigorous. This has made multicasting under QoS constraints one of the most prominent routing problems. The authors consider the problem of the efficient delivery of data stream to receivers for multi-source communication groups. Efficiency in this context means to minimize cost while meeting bounds on the end-to-end delay of the application. The authors adopt the multi-core approach and utilize SPAN (Karaman and Hassane, 2007)—a core-based framework for multi-source group applications — as the basis to develop greedy randomized adaptive search procedures (GRASP) for the associated constrained cost minimization problem. The procedures are tested in asymmetric networks and computational results show that they consistently outperform their counterparts in the literature.


2017 ◽  
Vol 23 (5) ◽  
pp. 349-366 ◽  
Author(s):  
Jesus Garcia-Diaz ◽  
Jairo Sanchez-Hernandez ◽  
Ricardo Menchaca-Mendez ◽  
Rolando Menchaca-Mendez

2003 ◽  
Vol 7 (4) ◽  
pp. 207-228 ◽  
Author(s):  
Hrvoje Podnar ◽  
Jadranka Skorin-Kapov

We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes that every two nodes can communicate and offers incentives to combine flow from different sources. Namely, there is a prescribed threshold on every link, and if the total flow on a link is greater than the threshold, the cost of this flow is discounted by a factor α. A heuristic algorithm based on genetic strategy is developed and applied to a benchmark set of problems. The results are compared with former branch and bound results using the CPLEX® solver. For larger data instances we were able to obtain improved solutions using less CPU time, confirming the effectiveness of our heuristic approach.


2020 ◽  
Vol 15 (3) ◽  
pp. 162-168
Author(s):  
Dian Pratiwi Sahar ◽  
Mohammad Thezar Afifudin

Penelitian ini bertujuan untuk mengembangkan model matematika untuk masalah minimisasi biaya pemuatan multi-kontainer dengan enam variabel orientasi kargo. Masalah ini dirumuskan sebagai model pemrograman linier biner integer untuk meminimalkan biaya. Faktor-faktor yang dipertimbangkan dalam formulasi termasuk alokasi kargo, lokasi kargo, hubungan kargo, dan orientasi kargo. Sedangkan, biaya yang dipertimbangkan termasuk biaya muatan volume kontainer ke kargo dan biaya transportasi kargo ke kontainer. Validasi model dilakukan melalui percobaan numerik pada ukuran kecil kargo dan kontainer. Hasil penelitian menunjukkan bahwa model dengan konsep orientasi kargo yang dikembangkan dapat menyelesaikan masalah sesuai dengan parameter numerik yang diberikan. Abstract[Integer Linear Programming with Six Cargo Orientation Variables for Multi-Container Loading Cost Minimization Problem] This research aims to develop the mathematic model for multi-container loading cost minimization problems with six cargo orientation variables. The problem is formulated as a binary integer linear programming model to minimize costs. The factors considered in the formulation include cargo allocation, cargo location, cargo relations, and cargo orientation. Whereas, the costs considered include the container volume load cost to cargo and the cargo transport cost to the container. Model validation is performed through numerical experiments on the small size of cargo and containers. The results show that the model with developed cargo orientation concept can solve the problem according to the given numerical parameters.Keywords: integer programming; cargo orientation; container loading; cost minimization


Processes ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 221 ◽  
Author(s):  
Patricia Mores ◽  
Ana Arias ◽  
Nicolás Scenna ◽  
José Caballero ◽  
Sergio Mussati ◽  
...  

This work deals with the optimization of two-stage membrane systems for H2 separation from off-gases in hydrocarbons processing plants to simultaneously attain high values of both H2 recovery and H2 product purity. First, for a given H2 recovery level of 90%, optimizations of the total annual cost (TAC) are performed for desired H2 product purity values ranging between 0.90 and 0.95 mole fraction. One of the results showed that the contribution of the operating expenditures is more significant than the contribution of the annualized capital expenditures (approximately 62% and 38%, respectively). In addition, it was found that the optimal trade-offs existing between process variables (such as total membrane area and total electric power) depend on the specified H2 product purity level. Second, the minimization of the total power demand and the minimization of the total membrane area were performed for H2 recovery of 90% and H2 product purity of 0.90. The TAC values obtained in the first and second cases increased by 19.9% and 4.9%, respectively, with respect to that obtained by cost minimization. Finally, by analyzing and comparing the three optimal solutions, a strategy to systematically and rationally provide ‘good’ lower and upper bounds for model variables and initial guess values to solve the cost minimization problem by means of global optimization algorithms is proposed, which can be straightforward applied to other processes.


Sign in / Sign up

Export Citation Format

Share Document