Gotowe bibliografie tematyczne / Joint allocation

Gotowa bibliografia na temat „Joint allocation”

Autor: Grafiati
Data publikacji: 25 maja 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Joint allocation”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Joint allocation"

1

Rideout, Douglas, i John Hof. "Allocating Joint Costs in Applied Forestry". Western Journal of Applied Forestry 2, nr 2 (1.04.1987): 45–48. http://dx.doi.org/10.1093/wjaf/2.2.45.

Pełny tekst źródła
Streszczenie:
Abstract Two cost allocation techniques, "separable costs-remaining benefits" and the "simple Shapley value," are discussed and evaluated. The evaluation is performed relative to basic principles of cost allocation: that separable costs should be covered and that allocations should not exceed respective benefits. Two examples demonstrate that neither allocation technique is always consistent with the principles. The paper also discusses conditions under which each technique conforms to the principles, in part and in full. West. J. Appl. For. 2(2):45-48, April 1987.
Style APA, Harvard, Vancouver, ISO itp.
2

Khumawala, Saleha B., Linda M. Parsons i Teresa P. Gordon. "TRACKS: Assessing the Quality of Not-For-Profit Efficiency Ratios: Do Donors Use Joint Cost Allocation Disclosures?" Journal of Accounting, Auditing & Finance 20, nr 3 (lipiec 2005): 287–309. http://dx.doi.org/10.1177/0148558x0502000305.

Pełny tekst źródła
Streszczenie:
We examine whether required disclosures regarding joint cost allocations raise concerns about the validity of efficiency ratios reported by not-for-profit organizations. An experimental design is used to hold constant the geographic location, size, and mission of competing charitable organizations. Participants include financial officers of not-for-profit organizations (preparers), foundation executives (expert donors), and students (novice donors). We find that preparers base contribution decisions almost entirely on the reported fund-raising cost and accept the validity of reported program ratios. Foundation executives, representing experienced users of not-for-profit financial statements, also appear to accept the joint cost allocations as reported. By contrast, novice users are the most attentive to the allocation disclosures and consider them more often when deciding on the amount of a hypothetical gift. Overall, there is little evidence that joint cost allocation disclosures are used to adjust reported expenditures for fund-raising costs. Based on our results, donors appear to ignore the effects of allocating joint costs. Although current accounting standards limit the availability of an accounting method commonly used to manage financial results, it appears that the opportunity for not-for-profit managers to use joint cost allocations to manage ratios and influence donors remains.
Style APA, Harvard, Vancouver, ISO itp.
3

Shastitko, Andrey, Anna Meleshkina i Anastasiya Shastitko. "Cost Allocation, Regulation and Incentives in Joint Production of Goods". Moscow University Economics Bulletin 2015, nr 1 (28.02.2015): 18–40. http://dx.doi.org/10.38050/01300105201512.

Pełny tekst źródła
Streszczenie:
This article addresses the joint cost allocation problem in context of firm’s price policy, market structure, enforcement of tax, environmental and antitrust legislation and the correlating problem of incentives’ design. The paper presents the theoretical foundations to distinguish such concepts as joint and by-product, their correlation with the category of waste. Moreover, the authors provide a comparative analysis of different methods of joint cost allocations and their areas of applicability. The practical part of this work involves the overview of actual practices of cost allocation in chemical industry. It confirms the need for an adjusted approach assessment of the efficiency and legitimacy of joint production in each particular case.
Style APA, Harvard, Vancouver, ISO itp.
4

ALMEIDA, VINICIO DE SOUZA E., i RICARDO PEREIRA CÂMARA LEAL. "A JOINT EXPERIMENTAL ANALYSIS OF INVESTOR BEHAVIOR IN IPO PRICING METHODS". Revista de Administração de Empresas 55, nr 1 (luty 2015): 14–25. http://dx.doi.org/10.1590/s0034-759020150103.

Pełny tekst źródła
Streszczenie:
This article jointly examines the differences of laboratory versions of the Dutch clock open auction, a sealed-bid auction to represent book building, and a two-stage sealed bid auction to proxy for the “competitive IPO”, a recent innovation used in a few European equity initial public offerings. We investigate pricing, seller allocation, and buyer welfare allocation efficiency and conclude that the book building emulation seems to be as price efficient as the Dutch auction, even after investor learning, whereas the competitive IPO is not price efficient, regardless of learning. The competitive IPO is the most seller allocative efficient method because it maximizes offer proceeds. The Dutch auction emerges as the most buyer welfare allocative efficient method. Underwriters are probably seeking pricing efficiency rather than seller or buyer welfare allocative efficiency and their discretionary pricing and allocation must be important since book building is prominent worldwide.
Style APA, Harvard, Vancouver, ISO itp.
5

Wang, Heng, Aijun Liu i Xiaofei Pan. "Optimization of Joint Power and Bandwidth Allocation in Multi-Spot-Beam Satellite Communication Systems". Mathematical Problems in Engineering 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/683604.

Pełny tekst źródła
Streszczenie:
Multi-spot-beam technique has been widely applied in modern satellite communication systems. However, the satellite power and bandwidth resources in a multi-spot-beam satellite communication system are scarce and expensive; it is urgent to utilize the resources efficiently. To this end, dynamically allocating the power and bandwidth is an available way. This paper initially formulates the problem of resource joint allocation as a convex optimization problem, taking into account a compromise between the maximum total system capacity and the fairness among the spot beams. A joint bandwidth and power allocation iterative algorithm based on duality theory is then proposed to obtain the optimal solution of this optimization problem. Compared with the existing separate bandwidth or power optimal allocation algorithms, it is shown that the joint allocation algorithm improves both the total system capacity and the fairness among spot beams. Moreover, it is easy to be implemented in practice, as the computational complexity of the proposed algorithm is linear with the number of spot beams.
Style APA, Harvard, Vancouver, ISO itp.
6

Thabet, Saqr Khalil Saeed, Emmanuel Osei-Mensah, Omar Ahmed, Abegaz Mohammed Seid i Olusola Bamisile. "Resource Optimization for 3D Video SoftCast with Joint Texture/Depth Power Allocation". Applied Sciences 12, nr 10 (17.05.2022): 5047. http://dx.doi.org/10.3390/app12105047.

Pełny tekst źródła
Streszczenie:
During wireless video transmission, channel conditions can vary drastically. When the channel fails to support the transmission bit rate, the video quality degrades sharply. A pseudo-analog transmission system such as SoftCast relies on linear operations to achieve a linear quality transition over a wide range of channel conditions. When transmitting 3D videos over SoftCast, the following issues arise: (1) assigning the transmission power to texture and depth maps to obtain the optimal overall quality and (2) handling 3D video data traffic by dropping and re-allocating resources. This paper solves the pseudo-analog transmission resource allocation problem and improves the results by applying the optimal joint power allocation. First, the minimum and the target distortion optimization problems are formulated in terms of a power–bandwidth pair versus distortion. Then, a minimum distortion optimization algorithm iteratively computes all the possible resource allocations to find the optimal allocation based on the minimum distortion. Next, the three-dimensional target distortion problem is divided into two subproblems. In the power-distortion problem, to obtain a target distortion, the algorithm exhaustively solves the closed form of the power resource under a predefined upper-bound bandwidth. For the bandwidth-distortion problem, reaching a target distortion requires solving iteratively for the bandwidth resource closed form, given a predefined power. The proposed resource control scheme shows an improvement in transmission efficiency and resource utilization. At low power usage, the proposed method could achieve a PSNR gain of up to 1.5 dB over SoftCast and even a 1.789 dB gain over a distortion-resource algorithm, using less than 1.4% of the bandwidth.
Style APA, Harvard, Vancouver, ISO itp.
7

Yao Song, Yao Song, Limin Xiao Yao Song, Liang Wang Limin Xiao, Wei Wei Liang Wang i Jinquan Wang Wei Wei. "Joint Online Optimization of Task Rescheduling and Data Redistribution". 網際網路技術學刊 24, nr 1 (styczeń 2023): 011–22. http://dx.doi.org/10.53106/160792642023012401002.

Pełny tekst źródła
Streszczenie:
<p>Wide-area distributed computing environment is the main platform for storing large amounts of data and conducting wide-area computing. Tasks and data are jointly scheduled among multiple computing platforms to improve system efficiency. However, large network latency and limited bandwidth in wide-area networks may cause a large delay in scheduling information and data migration, which brings low task execution efficiency and a long time waiting for data. Traditional works mainly focus on allocating tasks based on data locality or distributing data replications, but optimizing task allocation or data placement alone is insufficient from a global perspective. To mitigate the impact of large network latency and limited bandwidth on system performance, joint online optimization of task rescheduling and data redistribution is proposed in this study. The task allocation and data placement can be adjusted collaboratively during the system running process through the task stealing and backfilling mechanism and the data replication placement mechanism. The experimental results indicate that compared with the state-of-the-art method, the proposed method improves the system throughput and computing resource utilization by 20.67% and 20.26% respectively, and can significantly reduce the global data migration costs.</p> <p>&nbsp;</p>
Style APA, Harvard, Vancouver, ISO itp.
8

Zhang, Jiawei. "Cost Allocation for Joint Replenishment Models". Operations Research 57, nr 1 (luty 2009): 146–56. http://dx.doi.org/10.1287/opre.1070.0491.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Balachandran, Bala V., i Ram T. S. Ramakrishnan. "Joint Cost Allocation for Multiple Lots". Management Science 42, nr 2 (luty 1996): 247–58. http://dx.doi.org/10.1287/mnsc.42.2.247.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Barrymore, S. J. "RISK ALLOCATION IN PETROLEUM JOINT VENTURES". APPEA Journal 36, nr 1 (1996): 580. http://dx.doi.org/10.1071/aj95036.

Pełny tekst źródła
Streszczenie:
This paper will consider aspects of contractual risk allocation in the energy industry.The industry is a mature one, with sophisticated and experienced contractors and operators. Hydrocarbons have uniquely hazardous characteristics making all parties, the State and the community acutely aware of the need to control the means of its discovery, appraisal, production and transportation.The Exxon Valdez and Piper Alpha disasters are paradigm examples of the drastic consequences and the magnitude of the risk, that can flow from what might otherwise be considered 'a minor act or omission'.Risk management is based on the premise that it is in the interest of any project that certain risks be borne by certain parties, normally the person in the best position to control the risk concerned. A realistic approach to allocation of risk will reduce costs and claims and prevent over or under insurance. Where a risk which can be efficiently absorbed or covered by one party is passed to another, the short-term gain may be more than offset by the other party's increased charges or defensive practices for absorbing the risk or its inability to perform following a liability arising from that risk.As noted above, the risk allocation and management technique dealt with in this paper is contractual. Parties seek to distribute and allocate risks by the use of clauses of indemnity, limitation, exclusion, insurance and force majeure. Each of these contracts allocate risk to one party or the other for matters such as personal injury, property loss and damage, public liability, pollution, negligent workmanship and indirect loss or damage.This paper will examine the structure of these clauses (other than insurance) in the context of offshore development projects, centring around the joint operating agreement made between an operator and the licence holders, and a consideration of contracts entered into between the operator and its participants and the project contractors and project insurers. It will also address the issue of conduct in breach of statute and the effect of such conduct on indemnity and insurance agreements.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Joint allocation"

1

Harrop, John P. "Improving the Army's joint platform allocation tool (JPAT)". Thesis, Monterey, California: Naval Postgraduate School, 2013. http://hdl.handle.net/10945/37635.

Pełny tekst źródła
Streszczenie:
Approved for public release; distribution is unlimited
The U.S. Army's joint platform allocation tool (JPAT) is an integer linear program that was developed by the Army's Training and Doctrine Command Analysis Center and the Naval Postgraduate School to help inform acquisition decisions involving aerial reconnaissance and surveillance (R&S) resources. JPAT evaluates inputs such as mission requirements, locations of available equipment, and budgetary constraints to determine an effective assignment of unmanned aerial R&S assets to missions. As of September 2013, JPAT is solved using a rolling horizon approach, which produces a sub-optimal solution, and requires substantial computational resources to solve a problem of realistic size. Because JPAT is an integer linear program, it is a suitable candidate for using decomposition techniques to improve its computational efficiency. This thesis conducts an analysis of multiple approaches for increasing JPAT's computational efficiency. First, we reformulate JPAT using Benders decomposition. Then, we solve both the original and decomposed formulations using the simplex and barrier algorithms with multiple size datasets. In addition, we experiment with an initial heuristic solution and other techniques in our attempts to improve JPAT's runtime. We find that while Benders decomposition does not result in significant improvements in computation time for the instances considered in this thesis, initial solution heuristics and other modifications to the model improve JPAT's performance.
Style APA, Harvard, Vancouver, ISO itp.
2

Luo, Lu. "Joint routing and resource allocation in multihop wireless network /". View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20LUOL.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Lahad, Bachir. "Joint Uplink/Downlink Radio Resource Allocation in 5G HetNets". Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG057.

Pełny tekst źródła
Streszczenie:
La croissance rapide du trafic de données sans fil et des services intensifs en bande passante (voix sur IP, streaming vidéo, live streaming, etc.) nécessite de trouver des solutions viables pour améliorer la qualité de service et maximiser les performances du réseau. Pour s'adapter à ces applications intensives en bande passante, les réseaux cellulaires hétérogènes (HetNets) ont été introduits dans le 3GPP comme l'une des principales caractéristiques pour répondre à ces exigences avancées.Maintenant, en raison de la différence de charges de trafic de liaison montante (UL) et de liaison descendante (DL) attendues dans les prochaines générations HetNets, il devient essentiel d'ajuster dynamiquement les ressources UL/DL. Pour soutenir cette nouvelle approche, le duplexage temporel (TDD) dynamique a été proposé. Néanmoins, l'importance d'UL se pose avec l'évolution des réseaux sociaux et des solutions cloud. Par conséquent, il est très intéressant d’introduire de nouvelles techniques qui atténuent les interférences de l’UL, améliorent les débits UL et DL et permettent également une meilleure utilisation des ressources radio en fournissant un équilibrage de charge adéquat entre UL et DL. Une telle caractéristique supplémentaire est le découplage accès UL/DL.Dans notre travail, nous développons d'abord un modèle TDD dans HetNets. Dans ce modèle, nous dérivons des expressions analytiques pour la distribution de l'emplacement du brouilleur considérant tous les scénarios d’interférences possibles qui pourraient se produire dans les réseaux basés sur TDD, tout en tenant compte de l'impact nocif de cette interférence.Basé sur ce dernier résultat, nous dérivons la fonction de distribution et de génération de moment (MGF) de l’interférence intercellulaire montante et descendante considérant un réseau composé d'une macro-cellule et d'une petite cellule. Nous nous appuyons sur les expressions dérivées pour analyser la capacité moyenne de la cellule de référence dans les transmissions en liaison montante et en liaison descendante.Deuxièmement, nous développons un modèle statistique conjoint TDD/découplage pour mettre en évidence les avantages que le mode d'accès de découplage peut apporter à un système basé sur HetNet TDD. L'introduction du mode de découplage nécessite une analyse approfondie de l’étude de comparaison avec le mode d'accès couplé UL/DL conventionnel. Par conséquent, nous dérivons les statistiques du signal d'interférence et du signal d'intérêt des deux modes, puis analysons leur impact sur le performance du système.Ce travail a été étendu pour inclure le déploiement de plusieurs petites cellules, où des aperçus supplémentaires sur les avantages du mode de découplage sont fournies en termes de gains de découplage UL et DL. Suite à la mise en œuvre du modèle développé, il est démontré que le cas de découplage apporte de plus grands avantages dans la liaison montante et maintient la même amélioration dans la liaison descendante pour diverses valeurs de décalage et, ainsi, améliore les performances globales du système lorsqu'il est associé avec une technologie TDD dynamique. Il est en outre démontré que notre réseau modélisé peut être optimisé en adoptant la combinaison optimale à la fois du facteur de décalage des petites cellules et de la distance entre les petites cellules.D'un autre côté, l'évaluation des avantages d'un TDD adaptatif et du découplage dans un système basé sur HetNet en fonction des charges de trafic variant dans le temps, nécessite de trouver un simulateur de niveau système où nous pouvons présenter le motif derrière l' adoption de découplage et de TDD dynamique. À partir des scénarios de simulation mise en œuvre, il est observé que l'algorithme adaptatif proposé apporte des améliorations de performances significatives dans le débit UL et DL par rapport à un certain nombre de schémas conventionnels, principalement dans les systèmes fortement chargés
The rapid growth in wireless data traffic and bandwidth intensive services (voice over IP, video streaming, livestreaming, etc.) necessitates finding viable solutions to improve service quality and maximize thenetwork performance. To accommodate these bandwidth intensive applications, heterogeneous cellular networks (HetNets) were introduced in 3GPP as one of the main features to meet these advanced requirements. Yet, because of the difference in uplink (UL) and downlink (DL) traffic loads expected in the next HetNetsgeneration, it becomes essential to dynamically adjust UL/DL resources. To support this newapproach, dynamic time-division duplexing (TDD) has been proposed. Nevertheless, the importance of UL arises along with the evolution of social networking and cloudsolutions. Therefore, it is of great interest to introduce novel techniques that mitigate ULinterferences, improve UL and DL throughputs and allow as well, a better use of radio resources byproviding adequate load balancing among UL and DL. Such an additional feature is the decoupledUL/DL access.In our work, we first develop a TDD model in HetNets. Under this model, we derive analytical expressions for the distribution of the interferer location considering all possible interference scenarios that could occur in TDD-based networks, while taking into account the harmful impact of interference.Based on the latter result, we derive the distribution and moment generating function (MGF) of the uplink and downlinkinter-cell interference considering a network consisting of one macro cell and one small cell. We build on the derivedexpressions to analyze the average capacity of the reference cell in both uplink and downlink transmissions.Second, we develop a joint TDD/decoupling statistical model to highlight the benefits thatthe decoupling access mode can bring to a HetNet TDD based system, in terms of UL and DL spectral efficiencies and throughputs. Introducing the decoupling mode necessitates a thoroughcomparison study with the conventional coupled UL/DL access mode. Therefore, we derive the statistics of the interference signal and the signal of interest of both modes and then analyze their impact on the system performance.This work was extended to include multiple small cells deployment, where more insight into the benefits of decoupling mode is provided in terms of UL and DL decoupling gains. Further to the implementation of the developed model, it is shown that the decoupling case brings greater benefits in the uplink and maintains the same improvement in the downlink for various offset values and thus, improves the overall system performance when being combined with a dynamic TDD technology. It is further shown that our modeled network can be optimized by adopting the optimal combination of both the small cell offset factor and the distance between small cells.On the other hand, evaluating the benefits of an adaptive TDD and decoupling in a HetNet based system according to time-variant traffic loads, necessitates findinga system level simulator where we can present the motivation and accurately assess the role of both decoupling and dynamic TDD techniques in the UL/DL optimization problem. From the applied simulation scenarios, it is observed that the proposed adaptive algorithm (dynamic TDD with decoupling policies) yields significant performance improvements in UL and DL throughput compared to a number of conventional schemes, mainly in dense HetNet deployment and in highly loaded systems
Style APA, Harvard, Vancouver, ISO itp.
4

Tervo, V. (Valtteri). "Joint multiuser power allocation and iterative multi-antenna receiver design". Doctoral thesis, Oulun yliopisto, 2015. http://urn.fi/urn:isbn:9789526207292.

Pełny tekst źródła
Streszczenie:
Abstract This thesis concentrates on joint optimization of transmit power allocation and receive filtering in multiuser, multi-antenna communications. Due to the increasing number of wireless devices, the design of energy-efficient communication links is becoming increasingly important. In cellular mobile communications, reducing the average power consumption in uplink transmission is beneficial for users in order to extend battery life and, hence, energy efficiency in general. However, the power consumption of the high power amplifier (HPA) at the transmitter depends on the peak power of the transmission. This thesis focuses on power allocation problems for single-carrier (SC) frequency division multiple access (FDMA) and orthogonal FDMA (OFDMA) transmission assuming iterative reception. The goal in the first scheme presented in this thesis is to reduce the average power consumption by designing a power allocation method that takes into account the convergence properties of an iterative receiver in multiuser uplink communications. The proposed scheme can guarantee that the desired quality of service (QoS) is achieved after a sufficient number of iterations. Reducing the peak-to-average power ratio (PAPR) in any transmission system is beneficial because it allows the use of inexpensive, energy-efficient power amplifiers. The goal in the second scheme presented in this thesis is to control the PAPR of the transmitted signal. Hence, in addition to the QoS constraint, the instantaneous PAPR constraint is derived for SC-FDMA and OFDMA transmission. Moreover, a statistical approach is considered in which the power variance of the transmitted waveform is controlled. The QoS and PAPR constraints are considered jointly and, therefore, the proposed power allocation strategy jointly takes into account the channel quality and the PAPR characteristics of the power amplifier. However, the PAPR constraint can be adopted to any SC-FDMA or OFDMA framework and it is not restricted to the scheme presented in this thesis. The objective of the optimization problems considered throughout the thesis is to minimize the sum power. The majority of the derived constraints are non-convex and therefore, two alternative successive convex approximations (SCAs) are derived for all the non-convex constraints considered. The numerical results show that the proposed power allocation strategies can significantly reduce the average transmission power of users while allowing flexible PAPR control. Hence, the proposed methods can be used to extend battery life for users and especially improve the QoS at the cell edges
Tiivistelmä Väitöskirjassa tutkitaan lähettimessä tapahtuvan tehoallokoinnin sekä vastaanottimessa tapahtuvan signaalin suodatuksen yhteisoptimointia monikäyttöön suunnatussa langattomassa moniantennikommunikaatiossa. Langattomien laitteiden lukumäärän kasvaessa energiatehokkuuden merkitys tiedonsiirtolinkkien suunnittelussa korostuu. Soluihin perustuvassa langattomassa tietoliikenteessä keskimääräisen tehonkulutuksen pienentäminen ylälinkkilähetyksessä (käyttäjältä tukiasemaan) on tärkeää käyttäjän kannalta, sillä se pidentää laitteen akun kestoa. Lähettimen tehovahvistimen (high power amplifier (HPA)) tehonkulutus on kuitenkin verrannollinen lähetyksen huipputehoon. Väitöskirjassa luodaaan uusia menetelmiä sekä vertaillaan tehoallokointia yhden kantoaallon taajuustason monikäyttöön (single carrier frequency division multiple access (SC-FDMA)) ja ortogonaalisen taajuustason monikäyttöön (orthogonal FDMA (OFDMA)) perustuvissa lähetysteknologioissa. Työn ensimmäisessä osiossa tavoitteena on keskimääräisen tehonkulutuksen pienentäminen monen käyttäjän ylälinkkikommunikaatiossa suunnittelemalla tehoallokointimenetelmä, joka ottaa huomioon iteratiivisen vastaanottimen konvergenssiominaisuudet. Työssä ehdotettu menetelmä takaa vastaanotetun informaation halutun laadun (quality of service (QoS)) riittävän monen vastaanottimessa tehdyn iteraation jälkeen. Huipputehon ja keskitehon suhteen (peak to average power ratio (PAPR)) pienentäminen missä tahansa lähetyksessä on hyödyllistä, sillä sen ansiosta voidaan käyttää energiatehokkaampia ja halvempia tehovahvistimia. Työn jälkimmäisessä osiossa tavoitteena on kontrolloida lähetetyn signaalin huipputehon ja keskitehon suhdetta. Työn ensimmäisessä osiossa esitetyn QoS-rajoitteen lisäksi tehoallokointia rajoitetaan symbolisekvenssikohtaisella PAPR-rajoitteella SCFDMA- ja OFDMA-lähetyksessä. Lisäksi esitetään tilastollinen menetelmä, jossa rajoitetaan lähetetyn signaalin tehon varianssia. Kun käytetään yhtäaikaisesti QoS- ja PAPR-rajoitteita, voidaan tiedonsiirtokanavaan suunnitella optimaalinen tehoallokointi ottaen huomioon tehovahvistimen epälineaarisuudet. Työssä esitetty PAPR-rajoite on kuitenkin geneerinen, ja se voidaan sovittaa mihin tahansa SCFDMA- tai OFDMA- optimointikehykseen. Työssä esitettävien optimointiongelmien tavoitteena on käyttäjien summatehon minimointi. Suurin osa työssä esiintyvistä ongelmista on ei-konvekseja, joten siinä esitetään kaksi vaihtoehtoista peräkkäinen konveksi approksimaatio (successive convex approximation (SCA)) -menetelmää kaikille ei-konvekseille rajoitteille. Numeeriset tulokset osoittavat, että esitetyt tehoallokointimenetelmät pienentävät merkittävästi keskimääräistä tehonkulutusta mahdollistaen lisäksi adaptiivisen PAPR-kontrolloinnin. Väitöskirjassa esitettyjen menetelmien avulla voidaan pidentää mobiilikäyttäjien akun kestoa sekä erityisesti parantaa solun reunakäyttäjien palvelun laatua
Style APA, Harvard, Vancouver, ISO itp.
5

Gecili, Hakan. "Joint Shelf Design and Shelf Space Allocation Problem for Retailers". Wright State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=wright1594374475655644.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Abdul, Aziz Hasan Ali Aamir, i Muhammad Adil Shahzad. "A Joint Subcarrier/Power allocation Scheme for OFDMA-based Cellular Networks". Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-91310.

Pełny tekst źródła
Streszczenie:
The assignment of this master thesis consists of initiating power, subcarrier allocation in a dynamic FFR based scheme designed for multi-cell OFDMA networks and to enhance the throughput of all center users in bandwidth hungry borrower cells (overloaded cells) which was previously degraded by original FFR3 scheme as a result of partitioning of system bandwidth into center and edge bands respectively. The method uses band borrowing to compensate center user’s throughput loss in a semi and fully overloaded system. The scheme uses dynamic programming method (0/1 knapsack problem) to bargain an edge band on various power levels and tends to check the best combination (power and sub-carrier) which the system can utilize while still maintaining acceptable throughput loss for the users at the edge of the neighboring cell (lender cell). The algorithm consists of generating a borrowing request to neighboring cells for utilizing their edge bands by the overloaded borrower cell if their average center user throughput reaches below a minimum threshold value set in the system. The borrowing method uses 0/1 knapsack problem to capture an edge band based on limiting factors of total cost in average throughput losses by neighbors (Ci) and Un (tolerable mean user edge user throughput loss by lending cell). While solving knapsack problem the lender (neighbors) will check Ci and Un before granting the right to use its edge band. The later stage requires reducing subcarrier power level in order to utilize the lenders edge band using "soft borrower" mode. The borrowed sub-carriers will be activated take power from the original center band sub-carriers of the overloaded cell by taking into account the interference between the lender and the borrower. In case of negative (0) reply from the lender cell after the first request, multiple requests are generated at reduce power level at every step to order to acquire more bands. If a neighbor has band borrowing requests from multiple overloaded base stations, the band will be granted to the one which gives minimal loss in terms of throughput to the lender cell. The simulation results are analyzed w.r.t reuse-1 and FFR3 scheme of a multi cell regular and irregular scenarios comprising of lightly to heavily overloaded cells with various subcarrier allocation patterns. An overhead and time assessment is also presented between borrower and lender cells. Simulation results show an increase of 60% in center user’s throughput w.r.t original FFR3 scheme with an acceptable loss of 18% at the edges in complex overloaded scenarios while the overall system throughout increases by 35%.
Style APA, Harvard, Vancouver, ISO itp.
7

Fallgren, Mikael. "Optimization of Joint Cell, Channel and Power Allocation in Wireless Communication Networks". Doctoral thesis, KTH, Optimeringslära och systemteori, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-40274.

Pełny tekst źródła
Streszczenie:
In this thesis we formulate joint cell, channel and power allocation problems within wireless communication networks. The objectives are to maximize the user with mini- mum data throughput (Shannon capacity) or to maximize the total system throughput, referred to as the max-min and max-sum problem respectively. The complexity is stud- ied together with proposed optimization- and heuristic-based approaches. In the first paper an overall joint cell, channel and power allocation max-min prob- lem is formulated. We show that the decision problem is NP-hard and that the op- timization problem is not approximable unless P is equal to NP, for instances with a sufficiently large number of channels. Further, it follows that for a feasible binary cell and channel allocation, the remaining continuous power allocation optimization problem is still not approximable unless P is equal to NP. In addition, it is shown that first-order optimality conditions give global optimum of the single channel power al- location optimization problem, although the problem is in general not convex. In the following two papers heuristics for solving the overall problem are proposed. In the second paper we consider the single channel problem with convex combinations of the max-min and the max-sum objective functions. This variable utility provides the ability of tuning the amount of fairness and total throughput. The third paper investi- gates the multiple channel setting. On a system with three cells, eight mobile users and three channels, we perform an exhaustive search over feasible cell and channel alloca- tions. The exhaustive search is then compared to the less computationally expensive heuristic approaches, presenting potential earnings to strive for. A conclusion is that several of the proposed heuristics perform very well. The final paper incorporates fixed relay stations into the overall joint cell, channel and power allocation max-min problem. The complexity is inherited from the formula- tion without relay stations. Further, we propose a heuristic channel allocation approach that shows good performance, compared to an optimization based approach, in numer- ical simulations on the relay setting.
Financial support by the Swedish Foundation for Strategic Research (SSF) QC 20110915
Style APA, Harvard, Vancouver, ISO itp.
8

Mao, Shaobo. "Joint energy allocation for sensing and transmission in rechargeable wireless sensor networks". Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/42832.

Pełny tekst źródła
Streszczenie:
The energy management policy of a rechargeable wireless sensor network (WSN) needs to take into account the energy harvesting process, and is thus different from that of a traditional WSN powered by non-rechargeable batteries. In this thesis, we study the energy allocation for sensing and transmission in an energy harvesting sensor node with a rechargeable battery. The sensor aims to maximize the expected total amount of data transmitted subject to time-varying energy harvesting rate, energy availability in the battery, data availability in the data buffer, and channel fading. In this thesis, we first consider the energy allocation problem that assumes a fixed sensor lifetime. Then, we extend the energy allocation problem by taking into account the randomness of the senor lifetime. In the first part of this thesis, we study the joint energy allocation for sensing and transmission in an energy harvesting sensor node with a fixed sensor lifetime. We formulate the energy allocation problem as a finite-horizon Markov decision process (MDP) and propose an optimal energy allocation (OEA) algorithm using backward induction. We conduct simulations to compare the performance between our proposed OEA algorithm and the channel-aware energy allocation (CAEA) algorithm extended from [1]. Simulation results show that the OEA algorithm can transmit a much larger amount of data over a finite horizon than the CAEA algorithm under different settings. In the second part of this thesis, we extend the joint energy allocation problem by taking into account the randomness of the sensor lifetime, and formulate the problem as an infinite-horizon discounted MDP. We propose an optimal stationary energy allocation (OSEA) algorithm using the value iteration. We then consider a special case with infinite data backlog and prove that the optimal transmission energy allocation (OTEA) policy is monotone with respect to the amount of battery energy available. Finally, we conduct extensive simulations to compare the performance of the OSEA, OTEA, and CAEA algorithms. Results show that the OSEA algorithm transmits the largest amount of data, and the OTEA algorithm can achieve a near-optimal performance.
Style APA, Harvard, Vancouver, ISO itp.
9

Wei, Junyi. "QoS-aware joint power and subchannel allocation algorithms for wireless network virtualization". Thesis, University of Essex, 2017. http://repository.essex.ac.uk/20142/.

Pełny tekst źródła
Streszczenie:
Wireless network virtualization (WNV) is a promising technology which aims to overcome the network redundancy problems of the current Internet. WNV involves abstraction and sharing of resources among different parties. It has been considered as a long term solution for the future Internet due to its flexibility and feasibility. WNV separates the traditional Internet service provider’s role into the infrastructure provider (InP) and service provider (SP). The InP owns all physical resources while SPs borrow such resources to create their own virtual networks in order to provide services to end users. Because the radio resources is finite, it is sensible to introduce WNV to improve resources efficiency. This thesis proposes three resource allocation algorithms on an orthogonal frequency division multiple access (OFDMA)-based WNV transmission system aiming to improve resources utility. The subject of the first algorithm is to maximize the InP and virtual network operators’ (VNOs’) total throughput by means of subchannel allocation. The second one is a power allocation algorithm which aims to improve VNO’s energy efficiency. In addition, this algorithm also balances the competition across VNOs. Finally, a joint power and subchannel allocation algorithm is proposed. This algorithm tries to find out the overall transmission rate. Moreover, all the above alogorithms consider the InP’s quality of service (QoS) requirement in terms of data rate. The evaluation results indicates that the joint resource allocation algorithm has a better performance than others. Furthermore, the results also can be a guideline for WNV performance guarantees.
Style APA, Harvard, Vancouver, ISO itp.
10

Ngo, K. (KienTrung). "Joint energy harvesting time allocation and beamforming in two-way relaying network". Master's thesis, University of Oulu, 2019. http://jultika.oulu.fi/Record/nbnfioulu-201902271252.

Pełny tekst źródła
Streszczenie:
Abstract. A two-way relaying system with amplify-and-forward technique, where relay stations (RSs) acquire the energy from transmission signal and interferences, is considered. The RSs use the energy to amplify the signal received from the transmitter and forward it to the receiver. Particularly, energy harvesting (EH) and time switching (TS) are deployed. Based on the TS architecture, we divide transmission time into two time slots, which are EH phase and information transmission (IT) phase. In the EH phase, the RSs harvest the energy from the received radio frequency (RF) signal. In the IT phase, the RSs process and forward the transmission signal to the destination by energy harvesting during the EH phase. From such a transmission scheme, we investigate the optimal time ratio of the EH and IT phase as well as the beamforming at RSs in order to acquire the sum rate maximization. Since the sum-rate maximization problem is nonconvex, we develop an iterative algorithm based on the majorization-minimization (MM) technique to solve the problem. Furthermore, we deployed two schemes to overcome the self-interference to see the efficiency of each scheme related to sum-rate performance. The results show that power transmission and a number of relay station have a major impact on the sum rate performance of the two-way relay system.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Joint allocation"

1

Freedman, Warren. Joint and several liability: Allocation of risk and apportionment of damages. Stoneham, Mass: Butterworth Legal Publishers, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Seaman, Scott M. Allocation of losses in complex insurance coverage claims. Wyd. 2. [Eagan, MN]: West Legalworks, 2006.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Nitterhouse, Denise. The effect of alternative joint cost allocation methods on mailing strategies of nonprofit organizations. [Urbana, Ill.]: College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1985.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Saleem, Samir Taha. Resource allocation under the joint account and the land-water-charge systems: Is there a case for abandoning the joint account? [Khartoum]: Development Studies and Research Centre, Faculty of Economic & Social Studies, University of Khartoum, 1989.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Seaman, Scott M. The handbook on allocation/apportionment of losses involving complex insurance coverage claims. Little Falls, NJ: Glasser LegalWorks, 2000.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

M, Terry Joseph, i Southwest Fisheries Science Center (U.S.). Workshop, red. Fixed costs and joint cost allocation in the management of Pacific whiting: A workshop report. [La Jolla, Calif.]: U.S. Dept. of Commerce, National Oceanic and Atmospheric Administration, National Marine Fisheries Service, Southwest Fisheries Science Center, 1996.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

T, Godfrey James, i Frank Robert H, red. Common costs and fund-raising appeals: A guide to joint cost allocation in not-for-profit organizations. Pittsburgh, PA: Dial Pub. Co., 1991.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Griffin, Karen, Scott Murtishaw i Adam Langton. Joint California Public Utilities Commission and California Energy Commission staff paper on options for allocation of greenhouse gas allowances in the electricity sector: Joint agency staff paper. Sacramento, Calif.]: California Energy Commission, 2008.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

India. Parliament. Lok Sabha. Secretariat, red. Report, Joint Parliamentary Committee (JPC) to examine matters relating to allocation and pricing of telecom licences and spectrum (Fifteenth Lok Sabha). New Delhi: Lok Sabha Secretariat, 2013.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

United States. Congress. Senate. Committee on Labor and Human Resources., red. Putting patients first: Resolving allocation of transplant organs : joint hearing before the Subcommittee on Health and Environment of the Committee on Commerce, House of Representatives, and the Committee on Labor and Human Resources, U.S. Senate, One Hundred Fifth Congress, second session, June 18, 1998. Washington: U.S. G.P.O., 1998.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Joint allocation"

1

Demski, Joel S. "Joint Costs and Cost Allocation". W Managerial Uses of Accounting Information, 169–200. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4613-3641-9_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Wu, Feng, Chong Luo i Hancheng Lu. "Joint Bandwidth and Power Allocation". W Uncoded Multimedia Transmission, 91–110. Boca Raton: CRC Press, 2021. http://dx.doi.org/10.1201/9781003118688-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Wu, Feng, Chong Luo i Hancheng Lu. "Joint Subcarrier Matching and Power Allocation". W Uncoded Multimedia Transmission, 147–72. Boca Raton: CRC Press, 2021. http://dx.doi.org/10.1201/9781003118688-12.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Dutta, Rathindra Nath, i Sasthi C. Ghosh. "Joint Relay Selection and Frequency Allocation for D2D Communications". W Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 159–73. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91424-0_10.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Tayyari, Fariborz, i Hamid R. Parsaei. "Joint Cost Allocation to Multiple Products: Cost Accounting v.Engineering Techniques". W Economics of Advanced Manufacturing Systems, 189–99. Boston, MA: Springer US, 1992. http://dx.doi.org/10.1007/978-1-4615-3480-8_12.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Zhang, Wei, Wanbing He, Dan Wu i Yueming Cai. "Joint Mode Selection and Resource Allocation in Underlaying D2D Communication". W Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 206–19. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-72823-0_20.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Zhang, Xiaohong, Yong Li i Mugen Peng. "Joint User-Association and Resource-Allocation in Virtualized C-RAN". W Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 265–75. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-72823-0_26.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Chen, Yujiao, Hong Chen i Rong Chai. "A Joint Bandwidth and Power Allocation Scheme for Heterogeneous Networks". W Communications and Networking, 268–78. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66628-0_26.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Raffensperger, John F., i Mark W. Milke. "Water Allocation: The Joint Problem of Interaction and Transaction Cost". W Smart Markets for Water Resources, 1–17. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55008-4_1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Prasad, Ramjee, Suvra Sekhar Das i Muhammad Imadur Rahman. "Joint Link Adaptation and Resource Allocation in SISO/SIMO Systems". W Adaptive PHY-MAC Design for Broadband Wireless Systems, 261–305. New York: River Publishers, 2022. http://dx.doi.org/10.1201/9781003336969-10.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Joint allocation"

1

Kyropoulou, Maria, Warut Suksompong i Alexandros A. Voudouris. "Almost Envy-Freeness in Group Resource Allocation". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/57.

Pełny tekst źródła
Streszczenie:
We study the problem of fairly allocating indivisible goods between groups of agents using the recently introduced relaxations of envy-freeness. We consider the existence of fair allocations under different assumptions on the valuations of the agents. In particular, our results cover cases of arbitrary monotonic, responsive, and additive valuations, while for the case of binary valuations we fully characterize the cardinalities of two groups of agents for which a fair allocation can be guaranteed with respect to both envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX). Moreover, we introduce a new model where the agents are not partitioned into groups in advance, but instead the partition can be chosen in conjunction with the allocation of the goods. In this model, we show that for agents with arbitrary monotonic valuations, there is always a partition of the agents into two groups of any given sizes along with an EF1 allocation of the goods. We also provide an extension of this result to any number of groups.
Style APA, Harvard, Vancouver, ISO itp.
2

Yuen, Sheung Man, i Warut Suksompong. "Approximate Envy-Freeness in Graphical Cake Cutting". W Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/326.

Pełny tekst źródła
Streszczenie:
We study the problem of fairly allocating a divisible resource in the form of a graph, also known as graphical cake cutting. Unlike for the canonical interval cake, a connected envy-free allocation is not guaranteed to exist for a graphical cake. We focus on the existence and computation of connected allocations with low envy. For general graphs, we show that there is always a 1/2-additive-envy-free allocation and, if the agents' valuations are identical, a (2+\epsilon)-multiplicative-envy-free allocation for any \epsilon > 0. In the case of star graphs, we obtain a multiplicative factor of 3+\epsilon for arbitrary valuations and 2 for identical valuations. We also derive guarantees when each agent can receive more than one connected piece. All of our results come with efficient algorithms for computing the respective allocations.
Style APA, Harvard, Vancouver, ISO itp.
3

Segal-Halevi, Erel, Haris Aziz i Avinatan Hassidim. "Fair Allocation based on Diminishing Differences". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/174.

Pełny tekst źródła
Streszczenie:
Ranking alternatives is a natural way for humans to explain their preferences. It is being used in many settings, such as school choice (NY, Boston), Course allocations, and the Israeli medical lottery. In some cases (such as the latter two), several ``items'' are given to each participant. Without having any information on the underlying cardinal utilities, arguing about fairness of allocation requires extending the ordinal item ranking to ordinal bundle ranking. The most commonly used such extension is stochastic dominance (SD), where a bundle X is preferred over a bundle Y if its score is better according to all additive score functions. SD is a very conservative extension, by which few allocations are necessarily fair while many allocations are possibly fair. We propose to make a natural assumption on the underlying cardinal utilities of the players, namely that the difference between two items at the top is larger than the difference between two items at the bottom. This assumption implies a preference extension which we call diminishing differences (DD), where a X is preferred over Y if its score is better according to all additive score functions satisfying the DD assumption. We give a full characterization of allocations that are necessarily-proportional or possibly-proportional according to this assumption. Based on this characterization, we present a polynomial-time algorithm for finding a necessarily-DD-proportional allocation if it exists. Using simulations, we show that with high probability, a necessarily-proportional allocation does not exist but a necessarily-DD-proportional allocation exists, and moreover, that allocation is proportional according to the underlying cardinal utilities.
Style APA, Harvard, Vancouver, ISO itp.
4

Massand, Sagar, i Sunil Simon. "Graphical One-Sided Markets". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/70.

Pełny tekst źródła
Streszczenie:
We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well as the allocation within the agent's local neighbourhood. We specify agents' local neighbourhood in terms of a weighted graph. This extends the model of one-sided markets to incorporate neighbourhood externalities. We consider the solution concept of stability and show that, unlike in the case of one-sided markets, stable allocations may not always exist. When the underlying local neighbourhood graph is symmetric, a 2-stable allocation is guaranteed to exist and any decentralised mechanism where pairs of rational players agree to exchange objects terminates in such an allocation. We show that computing a 2-stable allocation is PLS-complete and further identify subclasses which are tractable. In the case of asymmetric neighbourhood structures, we show that it is NP-complete to check if a 2-stable allocation exists. We then identify structural restrictions where stable allocations always exist and can be computed efficiently. Finally, we study the notion of envy-freeness in this framework.
Style APA, Harvard, Vancouver, ISO itp.
5

Hosseini, Hadi, Aghaheybat Mammadov i Tomasz Wąs. "Fairly Allocating Goods and (Terrible) Chores". W Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/305.

Pełny tekst źródła
Streszczenie:
We study the fair allocation of mixture of indivisible goods and chores under lexicographic preferences---a subdomain of additive preferences. A prominent fairness notion for allocating indivisible items is envy-freeness up to any item (EFX). Yet, its existence and computation has remained a notable open problem. By identifying a class of instances with "terrible chores", we show that determining the existence of an EFX allocation is NP-complete. This result immediately implies the intractability of EFX under additive preferences. Nonetheless, we propose a natural subclass of lexicographic preferences for which an EFX and Pareto optimal (PO) allocation is guaranteed to exist and can be computed efficiently for any mixed instance. Focusing on two weaker fairness notions, we investigate finding EF1 and Pareto optimal allocations for special instances with terrible chores, and show that MMS and PO allocations can be computed efficiently for any mixed instance with lexicographic preferences.
Style APA, Harvard, Vancouver, ISO itp.
6

Segal-Halevi, Erel, i Warut Suksompong. "Democratic Fair Allocation of Indivisible Goods". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/67.

Pełny tekst źródła
Streszczenie:
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same group share the same set of goods even though they may have different preferences. Previous work has focused on unanimous fairness, in which all agents in each group must agree that their group's share is fair. Under this strict requirement, fair allocations exist only for small groups. We introduce the concept of democratic fairness, which aims to satisfy a certain fraction of the agents in each group. This concept is better suited to large groups such as cities or countries. We present protocols for democratic fair allocation among two or more arbitrarily large groups of agents with monotonic, additive, or binary valuations. Our protocols approximate both envy-freeness and maximin-share fairness. As an example, for two groups of agents with additive valuations, our protocol yields an allocation that is envy-free up to one good and gives at least half of the maximin share to at least half of the agents in each group.
Style APA, Harvard, Vancouver, ISO itp.
7

Hummel, Halvard. "On Lower Bounds for Maximin Share Guarantees". W Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/306.

Pełny tekst źródła
Streszczenie:
We study the problem of fairly allocating a set of indivisible items to a set of agents with additive valuations. Recently, Feige et al. (WINE'21) proved that a maximin share (MMS) allocation exists for all instances with n agents and no more than n + 5 items. Moreover, they proved that an MMS allocation is not guaranteed to exist for instances with 3 agents and at least 9 items, or n ≥ 4 agents and at least 3n + 3 items. In this work, we shrink the gap between these upper and lower bounds for guaranteed existence of MMS allocations. We prove that for any integer c > 0, there exists a number of agents n_c such that an MMS allocation exists for any instance with n ≥ n_c agents and at most n + c items, where n_c ≤ ⌊0.6597^c · c!⌋ for allocation of goods and n_c ≤ ⌊0.7838^c · c!⌋ for chores. Furthermore, we show that for n ≠ 3 agents, all instances with n + 6 goods have an MMS allocation.
Style APA, Harvard, Vancouver, ISO itp.
8

Amanatidis, Georgios, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender i Alexandros A. Voudouris. "Maximum Nash Welfare and Other Stories About EFX". W Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/4.

Pełny tekst źródła
Streszczenie:
We consider the classic problem of fairly allocating indivisible goods among agents with additive valuation functions and explore the connection between two prominent fairness notions: maximum Nash welfare (MNW) and envy-freeness up to any good (EFX). We establish that an MNW allocation is always EFX as long as there are at most two possible values for the goods, whereas this implication is no longer true for three or more distinct values. As a notable consequence, this proves the existence of EFX allocations for these restricted valuation functions. While the efficient computation of an MNW allocation for two possible values remains an open problem, we present a novel algorithm for directly constructing EFX allocations in this setting. Finally, we study the question of whether an MNW allocation implies any EFX guarantee for general additive valuation functions under a natural new interpretation of approximate EFX allocations.
Style APA, Harvard, Vancouver, ISO itp.
9

Zhou, Shengwei, i Xiaowei Wu. "Approximately EFX Allocations for Indivisible Chores". W Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/110.

Pełny tekst źródła
Streszczenie:
In this paper we study how to fairly allocate a set of m indivisible chores to a group of n agents, each of which has a general additive cost function on the items. Since envy-free (EF) allocation is not guaranteed to exist, we consider the notion of envy-freeness up to any item (EFX). In contrast to the fruitful results regarding the (approximation of) EFX allocations for goods, very little is known for the allocation of chores. Prior to our work, for the allocation of chores, it is known that EFX allocations always exist for two agents, or general number of agents with identical ordering cost functions. For general instances, no non-trivial approximation result regarding EFX allocation is known. In this paper we make some progress in this direction by showing that for three agents we can always compute a 5-approximation of EFX allocation in polynomial time. For n>=4 agents, our algorithm always computes an allocation that achieves an approximation ratio of 3n^2 regarding EFX. We also study the bi-valued instances, in which agents have at most two cost values on the chores, and provide polynomial time algorithms for the computation of EFX allocation when n=3, and (n-1)-approximation of EFX allocation when n>=4.
Style APA, Harvard, Vancouver, ISO itp.
10

Gourvès, Laurent, Julien Lesca i Anaëlle Wilczynski. "Object Allocation via Swaps along a Social Network". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/31.

Pełny tekst źródła
Streszczenie:
This article deals with object allocation where each agent receives a single item. Starting from an initial endowment, the agents can be better off by exchanging their objects. However, not all trades are likely because some participants are unable to communicate. By considering that the agents are embedded in a social network, we propose to study the allocations emerging from a sequence of simple swaps between pairs of neighbors in the network. This model raises natural questions regarding (i) the reachability of a given assignment, (ii) the ability of an agent to obtain a given object, and (iii) the search of Pareto-efficient allocations. We investigate the complexity of these problems by providing, according to the structure of the social network, polynomial and NP-complete cases.
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Joint allocation"

1

Day, Robert, George White, William Cook, M. Bryant i Robert Miller. Joint Materiel Apportionment and Allocation. Fort Belvoir, VA: Defense Technical Information Center, lipiec 1988. http://dx.doi.org/10.21236/ada199037.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Nesbitt, Peter A., Emily M. Craparo, Chris E. Marks, Jonathan K. Alt, Kristin D. Smead i Jessica L. Tabacca. Modification to the Joint Platform Allocation Tool (JPAT) to Include Additional Warfighting Functions. Aerial R&S Future. Fort Belvoir, VA: Defense Technical Information Center, lipiec 2013. http://dx.doi.org/10.21236/ada589383.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Aremu, Fatai. Donor Action for Empowerment and Accountability in Nigeria. Institute of Development Studies (IDS), marzec 2022. http://dx.doi.org/10.19088/ids.2022.015.

Pełny tekst źródła
Streszczenie:
Multiple development actors are interested in stimulating more inclusive fiscal governance. Efforts to generate greater budget transparency, citizen participation in resource allocation, and public oversight of government spending are commonplace. How can development donors and lenders support such efforts, and what are their limitations? How do their attempts to do so interact? Exploring the outcomes of two projects in the Nigerian States of Jigawa and Kaduna provide some answers to these questions. The projects pursue overlapping goals, but with different approaches. The Partnership to Engage, Reform and Learn (PERL) programme funded by the UK Foreign, Commonwealth & Development Office works in a granular and contextually adapted way in each state to construct joint government and civil initiatives that test and embed citizen engagement and oversight approaches. The World Bank States Financial Transparency Accountability and Sustainability (SFTAS) initiative offers financial incentives to states if they meet a set of common public financial management benchmarks. Their actions have been complementary in several ways, despite significant contextual differences between the states in terms of conflict dynamics and prevailing citizen–state relations. The projects also reinforced each other’s efforts on public procurement reform in Kaduna State. However, in Jigawa State, SFTAS incentives to pass a procurement law following a standard template failed to codify and may indeed reverse gains from longstanding PERL efforts supporting transparency. This illustrates how donors with similar reform objectives in the same contexts can unconsciously undermine existing efforts towards overarching public accountability goals.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Joint allocation” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii