1 |
Partial pooling by independent firms with allocation according to contribution to poolSilbermayr, Lena, Gerchak, Yigal January 2019 (has links) (PDF)
We consider two firms which pool some of their inventory. The pool is created by the firms' contributions, and a firm's entitlement for an allocation from the pool (if needed) is a function of its contribution. Transshipment from the pool is costly, but the firms can benefit from reduced risk through inventory sharing using the pool. We analyze the resulting non-cooperative game. We prove existence of a Nash equilibrium and compare it to a model with centralized control. An appropriate compensation cost for using the other firms contribution to the pool can induce the retailers to achieve centralized solutions. We also compare the optimal partial pooling strategy to the special cases of no pooling and complete pooling and discuss situations where it is likely that one of the special cases will be optimal. Numerical results confirm that in the prevalent practice of partial pooling the retailers can achieve higher expected profits than under no pooling or complete pooling and that there is a significant difference between a setting with independent players and a model of central control.
|
2 |
Modelling Fertiliser Use in the Glenelg Hopkins CatchmentSchlapp, Julia Emily, julia.schlapp@rmit.edu.au January 2009 (has links)
The improvement of water quality in the streams of the Glenelg Hopkins catchment is a priority of the Glenelg Hopkins regional strategy. A major source of water pollution in the region is linked to agricultural activities as high nutrient levels from runoff have the potential to increase the incidence of blue-green algae in the waterways. Land use change, reduced rainfall, more frequent extreme rainfall events and higher temperatures associated with climate change are likely to exacerbate this trend. Water testing data of the Total Phosphorus (TP) levels in the Hopkins River and at other sites within the Hopkins Catchment indicate increasing incidence of TP above the Environment Protection Authority's target levels for extended periods of each year. Earlier research indicated that phosphorus in runoff increases when pasture fertility increases and that fertiliser management practices should be considered as an element of preventative action for reducing nutrient pollution. During our research, a survey was undertaken in the Hopkins River catchment, to determine the current management of phosphorus (P) fertilisers on grazing and mixed enterprise farms, the attitude of farmers to natural resource management and their understanding of nutrient pollution. The survey also gathered information on the way farmers made fertiliser management decisions. If cooperation relating to phosphorus fertiliser application could be facilitated between groups of farmers, it may be possible to reduce nutrient runoff into the Hopkins waterways. Cooperative game theory has successfully been used worldwide in the resolution of environmental problems where there is an economic impact to the decision making process. In this project, the amount of phosphorus applied per hectare was used in a cooperative game theory model assessing the potential for cooperative action on phosphorus management by groups of farmers, based on the trade off between the economic cost of pollution to the region waterways and the economic production benefits to the individual. The outcome of this work was individual optimal strategies for fertiliser application, allowing individual farmers to reduce their impact of agricultural production on the health of the catchment. Involving the farmer groups, while undertaking the project, raised awareness amongst the farming population of the regional nutrient pollution caused by runoff from agricultural land, and enlisted their assistance towards adopting a cooperative approach to the problem. In addition, the results have been mapped using a Geographical Information System (GIS) for visual presentation and to demonstrate the use of this process in natural resource management with the farmer groups.
|
3 |
Formal Methods of Value Sharing in Supply ChainsKemahlioglu Ziya, Eda 08 June 2004 (has links)
We consider a decentralized, two-echelon supply chain where the upper echelon --the supplier-- bears the inventory risk. To service the retailers, the supplier either keeps inventory reserved for each of her customers or else pools inventory to share among her customers. The common insight regarding inventory pooling is that it reduces costs and so increases profits for the supply chain party carrying inventory. However, it has recently been shown that inventory pooling may indeed reduce the total supply chain profits. We further show that inventory pooling may reduce supply chain profits even under traditional service contracts based on the frequently invoked measure of service, probability of stock-out.
We model the inventory transactions among the retailers and the supplier as a cooperative game. The players have the option of reserving inventory or forming inventory-pooling coalitions. The total profit of the coalitions is allotted to the players using a profit-sharing mechanism based on Shapley value. We analyze the properties of the proposed profit-sharing scheme in two steps. We first consider a stylized model with two retailers who are not necessarily identical. Then we extend the analysis to an arbitrary number of identical retailers. In both cases, we assume the demand across retailers is independent.
We find that the Shapley value allocations coordinate the supply chain and are individually rational. However for more than two retailers, they may not be in the core. Even when they satisfy all the stability properties, including membership in the core, they may be perceived unfair since a player's allocation can exceed his contribution to the total supply chain profit. In addition to analyzing the stability properties of the proposed allocation mechanism, we are also interested in the types of behavior the mechanism induces in the players. We find that the retailers prefer pooling partners with either very high or low service level requirements and the supplier prefers retailers with low service requirements since this gives her the ability to maximize her profit allocation. Finally, we analyze the effects of demand variance on the allocations and the profitability of strategic retailer coalitions.
|
4 |
noneLin, Guei-yi 29 June 2009 (has links)
If the market of military procurement conforms to the double auction (Chatterjee and Samuelson, 1983), the government and the manufacturer can try to reach a binding agreement and maximize the monopoly profit. When they both comply with the agreement, the game constitutes a cooperative game. The government and the firm can extend the periods of the game from one to two through signing the research and development contract. When they carry out the research and development contract in the second phase, the trading probability in the first phase that is double auction model will rise.
However the R&D contract causes an increase of transaction probability, the market offers an opportunity let the ineligible manufacturer participate in the defense procurement. We can find the trade-off relationship between the advancement of trading probability and the appearances of unqualified firm. The result is consistent with Inefficiency theorem that an incentive-compatible mechanism which is ex post efficient will not be individual theorem.
|
5 |
Kooperativní hry s částečnou informací / Cooperative games with partial informationČerný, Martin January 2021 (has links)
(english) May 21, 2021 Partially defined cooperative games are a generalisation of classical coopera- tive games in which the worth of some of the coalitions is not known. Therefore, they are one of the possible approaches to uncertainty in cooperative game the- ory. The main focus of this thesis is to collect and extend the existing results in this theory. We present results on superadditivity, convexity, positivity and 1-convexity of incomplete games. For all the aforementioned properties, a de- scription of the set of all possible extensions (complete games extending the incomplete game) is studied. Different subclasses of incomplete games are con- sidered, among others incomplete games with minimal information, incomplete games with defined upper vector or symmetric incomplete games. Some of the results also apply to fully generalised games. For superadditivity and 1-convexity, solution concepts (considering only par- tial information) are introduced and studied. Especially for 1-convexity, a thor- ough investigation of the defined solution concepts consisting of different char- acterisations is provided. 1
|
6 |
Energy Modelling and Fairness for Efficient Mobile CommunicationVergara Alonso, Ekhiotz Jon January 2016 (has links)
Energy consumption and its management have been clearly identified as a challenge in computing and communication system design, where energy economy is obviously of paramount importance for battery powered devices. This thesis addresses the energy efficiency of mobile communication at the user end in the context of cellular networks. We argue that energy efficiency starts by energy awareness and propose EnergyBox, a parametrised tool that enables accurate and repeatable energy quantification at the user end using real data traffic traces as input. EnergyBox offers an abstraction of the underlying states for operation of the wireless interfaces and allows to estimate the energy consumption for different operator settings and device characteristics. The tool is used throughout the thesis to quantify and reveal inefficient data communication patterns of widely used mobile applications. We consider two different perspectives in the search of energy-efficient solutions. From the application perspective, we show that systematically quantifying the energy consumption of design choices (e.g., communication patterns, protocols, and data formats) contributes to a significantly smaller energy footprint. From the system perspective, we devise a cross-layer solution that schedules packet transmissions based on the knowledge of the network parameters that impact the energy consumption of the handset. These attempts show that application level decisions require a better understanding of possible energy apportionment policies at system level. Finally, we study the generic problem of determining the contribution of an entity (e.g., application) to the total energy consumption of a given system (e.g., mobile device). We compare the state-of-the-art policies in terms of fairness leveraging cooperative game theory and analyse their required information and computational complexity. We show that providing incentives to reduce the total energy consumption of the system (as part of fairness) is tightly coupled to the policy selection. Our study provides guidelines to select an appropriate policy depending on the characteristics of the system.
|
7 |
Tools for enterprises collaboration in virtual enterprisesKumar, Sri K. January 2013 (has links)
Virtual Enterprise (VE) is an organizational collaboration concept which provides a competitive edge in the globalized business environment. The life cycle of a VE consists of four stages i.e. opportunity identification (Pre-Creation), partner selection (Creation), operation and dissolution. The success of VEs depends upon the efficient execution of their VE-lifecycles along with knowledge enhancement for the partner enterprises to facilitate the future formation of efficient VEs. This research aims to study the different issues which occur in the VE lifecycle and provides a platform for the formation of high performance enterprises and VEs. In the pre-creation stage, enterprises look for suitable partners to create their VE and to exploit a market opportunity. This phase requires explicit and implicit information extraction from enterprise data bases (ECOS-ontology) for the identification of suitable partners. A description logic (DL) based query system is developed to extract explicit and implicit information and to identify potential partners for the creation of the VE. In the creation phase, the identified partners are analysed using different risks paradigms and a cooperative game theoretic approach is used to develop a revenue sharing mechanism based on enterprises inputs and risk minimization for optimal partner selection. In the operation phases, interoperability remains a key issue for seamless transfer of knowledge information and data. DL-based ontology mapping is applied in this research to provide interoperability in the VE between enterprises with different domains of expertise. In the dissolution stage, knowledge acquired in the VE lifecycle needs to be disseminated among the enterprises to enhance their competitiveness. A DL-based ontology merging approach is provided to accommodate new knowledge with existing data bases with logical consistency. Finally, the proposed methodologies are validated using the case study. The results obtained in the case study illustrate the applicability and effectiveness of proposed methodologies in each stage of the VE life cycle.
|
8 |
Non-cooperative beaconing control in vehicular ad hoc networksGoudarzi, Forough January 2017 (has links)
The performance of many protocols and applications of Vehicular Ad hoc Networks (VANETs), depends on vehicles obtaining enough fresh information on the status of their neighbouring vehicles. This should be fulfilled by exchanging Basic Safety Messages (BSMs) also called beacons using a shared channel. In dense vehicular conditions, many of the beacons are lost due to channel congestion. Therefore, in such conditions, it is necessary to control channel load at a level that maximizes BSM dissemination. To address the problem, in this thesis algorithms for adaptation of beaconing to control channel load are proposed. First, a position-based routing protocol for VANETs is proposed and the requirement of adaptive beaconing to increase the performance of the protocol is indicated. The routing protocol is traffic-aware and suitable for city environments and obtains real-time traffic information in a completely ad hoc manner without any central or dedicated control, such as traffic sensors, roadside units, or information obtained from outside the network. The protocol uses an ant-based algorithm to find a route that has optimum network connectivity. Using information included in small control packets called ants, vehicles calculate a weight for every street segment that is proportional to the network connectivity of that segment. Ant packets are launched by vehicles in junction areas. To find the optimal route between a source and destination, a source vehicle determines the path on a street map with the minimum total weight for the complete route. The correct functionality of the protocol design has been verified and its performance has been evaluated in a simulation environment. Moreover, the performance of the protocol in different vehicular densities has been studied and indicated that in dense vehicular conditions the performance of the protocol degrades due to channel load created by uncontrolled periodic beaconing. Then, the problem of beaconing congestion control has been formulated as non-cooperative games, and algorithms for finding the equilibrium point of the games have been presented. Vehicles as players of the games adjust their beacon rate or power or both, based on the proposed algorithms so that channel load is controlled at a desired level. The algorithms are overhead free and fairness in rate or power or both rate and power allocation are achieved without exchanging excess information in beacons. Every vehicle just needs local information on channel load while good fairness is achieved globally. In addition, the protocols have per-vehicle parameters, which makes them capable of meeting application requirements. Every vehicle can control its share of bandwidth individually based on its dynamics or requirements, while the whole usage of the bandwidth is controlled at an acceptable level. The algorithms are stable, computationally inexpensive and converge in a short time, which makes them suitable for the dynamic environment of VANETs. The correct functionality of the algorithms has been validated in several high density scenarios using simulations.
|
9 |
Effective Resource Allocation for Non-cooperative Spectrum SharingJacob-David, Dany D. 13 October 2011 (has links)
Spectrum access protocols have been proposed recently to provide flexible and efficient use
of the available bandwidth. Game theory has been applied to the analysis of the problem
to determine the most effective allocation of the users’ power over the bandwidth. However,
prior analysis has focussed on Shannon capacity as the utility function, even though it is
known that real signals do not, in general, meet the Gaussian distribution assumptions of that metric. In a non-cooperative spectrum sharing environment, the Shannon capacity utility function results in a water-filling solution. In this thesis, the suitability of the water-filling solution is evaluated when using non-Gaussian signalling first in a frequency non-selective environment to focus on the resource allocation problem and its outcomes. It is then extended to a frequency selective environment to examine the proposed algorithm in a more realistic wireless environment. It is shown in both scenarios that more effective resource allocation can be achieved when the utility function takes into account the actual signal characteristics.
Further, it is demonstrated that higher rates can be achieved with lower transmitted power,
resulting in a smaller spectral footprint, which allows more efficient use of the spectrum
overall. Finally, future spectrum management is discussed where the waveform adaptation
is examined as an additional option to the well-known spectrum agility, rate and transmit
power adaptation when performing spectrum sharing.
|
10 |
Effective Resource Allocation for Non-cooperative Spectrum SharingJacob-David, Dany D. 13 October 2011 (has links)
Spectrum access protocols have been proposed recently to provide flexible and efficient use
of the available bandwidth. Game theory has been applied to the analysis of the problem
to determine the most effective allocation of the users’ power over the bandwidth. However,
prior analysis has focussed on Shannon capacity as the utility function, even though it is
known that real signals do not, in general, meet the Gaussian distribution assumptions of that metric. In a non-cooperative spectrum sharing environment, the Shannon capacity utility function results in a water-filling solution. In this thesis, the suitability of the water-filling solution is evaluated when using non-Gaussian signalling first in a frequency non-selective environment to focus on the resource allocation problem and its outcomes. It is then extended to a frequency selective environment to examine the proposed algorithm in a more realistic wireless environment. It is shown in both scenarios that more effective resource allocation can be achieved when the utility function takes into account the actual signal characteristics.
Further, it is demonstrated that higher rates can be achieved with lower transmitted power,
resulting in a smaller spectral footprint, which allows more efficient use of the spectrum
overall. Finally, future spectrum management is discussed where the waveform adaptation
is examined as an additional option to the well-known spectrum agility, rate and transmit
power adaptation when performing spectrum sharing.
|
Page generated in 0.063 seconds