Thematische Bibliographien / Joint allocation

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Joint allocation“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Zuletzt aktualisiert am 31. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Joint allocation" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Joint allocation"

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

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khumawala, Saleha B., Linda M. Parsons, and 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, no. 3 (2005): 287–309. http://dx.doi.org/10.1177/0148558x0502000305.

Der volle Inhalt der Quelle

Annotation:

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 r

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 ch

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 competitiv

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Guo, Qiuyi. "A Study on Benefit Allocation in Joint Distribution of Last-Mile Delivery." Highlights in Business, Economics and Management 48 (March 3, 2025): 45–52. https://doi.org/10.54097/3fca3720.

Der volle Inhalt der Quelle

Annotation:

The establishment of a benefit allocation mechanism for last-mile joint delivery alliances aims to stabilize cooperative relationships within the alliance. Based on the traditional Shapley value method, this study extends the approach by incorporating four influencing factors: risk-sharing, resource input, delivery volume, and customer satisfaction. An improved Shapley value-based benefit allocation model is developed for joint delivery alliances to address the issue of simplistic and averaged benefit distribution, providing member enterprises with fair and reasonable allocations. Finally, a c

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Heng, Aijun Liu, and 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.

Der volle Inhalt der Quelle

Annotation:

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 p

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 so

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

<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 all

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Joint allocation"

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.

Der volle Inhalt der Quelle

Annotation:

Approved for public release; distribution is unlimited<br>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 rollin

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 descen

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Abdul, Aziz Hasan Ali Aamir, and 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.

Der volle Inhalt der Quelle

Annotation:

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 e

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 no

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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,

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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/.

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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 p

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Joint allocation"

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Seaman, Scott M. Allocation of losses in complex insurance coverage claims. 2nd ed. West Legalworks, 2006.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Griffin, Karen, Scott Murtishaw, and 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. California Energy Commission, 2008.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Salazar, Gabriel R. An analysis of the role of the Joint Chiefs of Staff in the requirements generation and resource allocation process within the Department of Defense. Naval Postgraduate School, 1996.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Joint allocation"

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wu, Feng, Chong Luo, and Hancheng Lu. "Joint Bandwidth and Power Allocation." In Uncoded Multimedia Transmission. CRC Press, 2021. http://dx.doi.org/10.1201/9781003118688-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wu, Feng, Chong Luo, and Hancheng Lu. "Joint Subcarrier Matching and Power Allocation." In Uncoded Multimedia Transmission. CRC Press, 2021. http://dx.doi.org/10.1201/9781003118688-12.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Joint allocation"

Van Der Werf, Ids, Geert Leus, and Sundeep Prabhakar Chepuri. "Receiver Antenna Allocation for Joint Sensing and Communications." In 2024 IEEE 13th Sensor Array and Multichannel Signal Processing Workshop (SAM). IEEE, 2024. http://dx.doi.org/10.1109/sam60225.2024.10636382.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Dayong, Chao Yuan, Yu Sun, et al. "Channel and space-based joint rate allocation algorithm." In ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2025. https://doi.org/10.1109/icassp49660.2025.10889992.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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). Mo

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 b

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 pre

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 protoco

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 numbe

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Joint allocation"

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 Engag

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lee, Michael Junho, Antoine Martin, and Robert M. Townsend. Optimal Design of Tokenized Markets. Federal Reserve Bank of New York, 2024. http://dx.doi.org/10.59576/sr.1121.

Der volle Inhalt der Quelle

Annotation:

Trades in today’s financial system are inherently subject to settlement uncertainty. This paper explores tokenization as a potential technological solution. A token system, by enabling programmability of assets, can be designed to eradicate settlement uncertainty. We study the allocations achieved in a decentralized market with either the legacy settlement system or a token system. Tokenization can improve efficiency in markets subject to a limited commitment problem. However, it also materially alters the information environment, which in turn aggravates a hold-up problem. This limits potenti

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!