اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCooperation and Competition when Bidding for Complex Projects: Centralized and Decentralized Perspectives
127
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
To successfully complete a complex project, be it a construction of an airport or of a backbone IT system, agents (companies or individuals) must form a team having required competences and resources. A team can be formed either by the project issuer based on individual agents offers (centralized formation); or by the agents themselves (decentralized formation) bidding for a project as a consortium---in that case many feasible teams compete for the contract. We investigate rational strategies of the agents (what salary should they ask? with whom should they team up?). We propose concepts to characterize the stability of the winning teams and study their computational complexity.
قيم البحث
اقرأ أيضاً
When can cooperation arise from self-interested decisions in public goods games? And how can we help agents to act cooperatively? We examine these classical questions in a pivotal participation game, a variant of public good games, where heterogeneou
s agents make binary participation decisions on contributing their endowments, and the public project succeeds when it has enough contributions. We prove it is NP-complete to decide the existence of a cooperative Nash equilibrium such that the project succeeds. We also identify two natural special scenarios where this decision problem is tractable. We then propose two algorithms to help cooperation in the game. Our first algorithm adds an external investment to the public project, and our second algorithm uses matching funds. We show that the cost to induce a cooperative Nash equilibrium is near-optimal for both algorithms. Finally, the cost of matching funds can always be smaller than the cost of adding an external investment. Intuitively, matching funds provide a greater incentive for cooperation than adding an external investment does.
Cellular has always relied on static deployments for providing wireless access. However, even the emerging fifth-generation (5G) networks may face difficulty in supporting the increased traffic demand with rigid, fixed infrastructure without substant
ial over-provisioning. This is particularly true for spontaneous large-scale events that require service providers to augment capacity of their networks quickly. Today, the use of aerial devices equipped with high-rate radio access capabilities has the potential to offer the much needed on-demand capacity boost. Conversely, it also threatens to rattle the long-standing business strategies of wireless operators, especially as the gold rush for cheaper millimeter wave (mmWave) spectrum lowers the market entry barriers. However, the intricate structure of this new market presently remains a mystery. This paper sheds light on competition and cooperation behavior of dissimilar aerial mmWave access suppliers, concurrently employing licensed and license-exempt frequency bands, by modeling it as a vertically differentiated market where customers have varying preferences in price and quality. To understand viable service provider strategies, we begin with constructing the Nash equilibrium for the initial market competition by employing the Bertrand and Cournot games. We then conduct a unique assessment of short-term market dynamics, where two licensed-band service providers may cooperate to improve their competition positions against the unlicensed-band counterpart intruding the market. Our unprecedented analysis studies the effects of various market interactions, price-driven demand evolution, and dynamic profit balance in this novel type of ecosystem.
Systems with simultaneous cooperation and competition among the elements are ubiquitous. In spite of their practical importance, knowledge on the evolution mechanism of this class of complex system is still very limit. In this work, by conducting ext
ensive empirical survey to a large number of cooperation-competition systems which cover wide categories and contain the information of network topology, cooperation-competition gain, and the evolution time, we try to get some insights to the universal mechanism of their evolutions. Empirical investigations show that the distributions of the cooperation-competition gain interpolates between power law function and exponential function. Particularly, we found that the cooperation-competition systems with longer evolution durations tend to have more heterogeneous distributions of the cooperation-competition gain. Such an empirical observation can be well explained by an analytic model in which the evolution of the systems are mainly controlled by the Matthew effect, and the marginal heterogeneity of the initial distribution is amplified by the Matthew effect with similar speed in spite of the diversity of the investigated systems.
The real-time bidding (RTB), aka programmatic buying, has recently become the fastest growing area in online advertising. Instead of bulking buying and inventory-centric buying, RTB mimics stock exchanges and utilises computer algorithms to automatic
ally buy and sell ads in real-time; It uses per impression context and targets the ads to specific people based on data about them, and hence dramatically increases the effectiveness of display advertising. In this paper, we provide an empirical analysis and measurement of a production ad exchange. Using the data sampled from both demand and supply side, we aim to provide first-hand insights into the emerging new impression selling infrastructure and its bidding behaviours, and help identifying research and design issues in such systems. From our study, we observed that periodic patterns occur in various statistics including impressions, clicks, bids, and conversion rates (both post-view and post-click), which suggest time-dependent models would be appropriate for capturing the repeated patterns in RTB. We also found that despite the claimed second price auction, the first price payment in fact is accounted for 55.4% of total cost due to the arrangement of the soft floor price. As such, we argue that the setting of soft floor price in the current RTB systems puts advertisers in a less favourable position. Furthermore, our analysis on the conversation rates shows that the current bidding strategy is far less optimal, indicating the significant needs for optimisation algorithms incorporating the facts such as the temporal behaviours, the frequency and recency of the ad displays, which have not been well considered in the past.
In this paper, we construct a decentralized clearing mechanism which endogenously and automatically provides a claims resolution procedure. This mechanism can be used to clear a network of obligations through blockchain. In particular, we investigate
default contagion in a network of smart contracts cleared through blockchain. In so doing, we provide an algorithm which constructs the blockchain so as to guarantee the payments can be verified and the miners earn a fee. We, additionally, consider the special case in which the blocks have unbounded capacity to provide a simple equilibrium clearing condition for the terminal net worths; existence and uniqueness are proven for this system. Finally, we consider the optimal bidding strategies for each firm in the network so that all firms are utility maximizers with respect to their terminal wealths. We first look for a mixed Nash equilibrium bidding strategies, and then also consider Pareto optimal bidding strategies. The implications of these strategies, and more broadly blockchain, on systemic risk are considered.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
