scholarly journals ON THE IMPOSSIBILITY OF DETERRENCE IN SEQUENTIAL COLONEL BLOTTO GAMES

2012 ◽  
Vol 14 (02) ◽  
pp. 1250011 ◽  
Author(s):  
KJELL HAUSKEN

A sequential Colonel Blotto and rent seeking game with fixed and variable resources is analyzed. With fixed resources, which is the assumption in Colonel Blotto games, we show for the common ratio form contest success function that the second mover is never deterred. This stands in contrast to Powell's (Games and Economic Behavior67(2), 611–615) finding where the second mover can be deterred. With variable resources both players exert efforts in both sequential and simultaneous games, whereas fixed resources cause characteristics of all battlefields or rents to impact efforts for each battlefield. With variable resources only characteristics of a given battlefield impact efforts are to win that battlefield because of independence across battlefields. Fixed resources impact efforts and hence differences in unit effort costs are less important. In contrast, variable resources cause differences in unit effort costs to be important. The societal implication is that resource constrained opponents can be expected to engage in warfare, whereas an advantaged player with no resource constraints can prevent warfare.

2020 ◽  
Author(s):  
Subhasish M Chowdhury ◽  
Dan Kovenock ◽  
David Rojo Arjona ◽  
Nathaniel T Wilcox

Abstract This article examines the influence of focality in Colonel Blotto games with a lottery contest success function, where the equilibrium is unique and in pure strategies. We hypothesize that the salience of battlefields affects strategic behaviour (the salient target hypothesis) and present a controlled test of this hypothesis against Nash predictions, checking the robustness of equilibrium play. When the sources of salience come from asymmetries in battlefield values or labels (as in Schelling, 1960), subjects over-allocate the resource to the salient battlefields relative to the Nash prediction. However, the effect is stronger with salient values. In the absence of salience, we find support for the Nash prediction.


2021 ◽  
Vol 1 (11) ◽  
Author(s):  
Kjell Hausken

AbstractA rent seeking model is axiomatized where players exert multiple additive efforts which are substitutable in the contest success function. The axioms assume the sufficiency of exerting one effort, and that adding an amount to one effort and subtracting the same amount from a second equivalent substitutable effort keeps the winning probabilities unchanged. In contrast, the multiplicative Cobb–Douglas production function in the earlier literature requires players to exert all their complementary efforts. The requirement follows from assuming a homogeneity axiom where an equiproportionate change in two players’ matched efforts does not affect the winning probabilities. This article abandons the homogeneity axiom and assumes an alternative axiom where the winning probabilities remain unchanged when a fixed positive amount is added to all players’ efforts. This article also assumes a so-called summation axiom where the winning probabilities remain unchanged when a player substitutes an amount of effort from one effort into another effort. The summation axiom excludes multiplicative production functions, and furnishes a foundation for additive production functions.


2019 ◽  
Author(s):  
Dong Liang ◽  
Yunlong Wang ◽  
Zhigang Cao ◽  
Xiaoguang Yang

2011 ◽  
Vol 12 (3) ◽  
pp. 256-273 ◽  
Author(s):  
Marco Runkel

Abstract This paper investigates revenue sharing in an asymmetric two-teams contest model of a sports league with Nash behavior of team owners. The innovation of the analysis is that it focuses on the role of the contest success function (CSF). In case of an inelastic talent supply, revenue sharing turns out to worsen competitive balance regardless of the shape of the CSF. For the case of an elastic talent supply, in contrast, the effect of revenue sharing on competitive balance depends on the specification of the CSF. We fully characterize the class of CSFs for which revenue sharing leaves unaltered competitive balance and identify CSFs ensuring that revenue sharing renders the contest closer.


Author(s):  
Ahmed Imteaj ◽  
M. Hadi Amini

Federated Learning (FL) is a recently invented distributed machine learning technique that allows available network clients to perform model training at the edge, rather than sharing it with a centralized server. Unlike conventional distributed machine learning approaches, the hallmark feature of FL is to allow performing local computation and model generation on the client side, ultimately protecting sensitive information. Most of the existing FL approaches assume that each FL client has sufficient computational resources and can accomplish a given task without facing any resource-related issues. However, if we consider FL for a heterogeneous Internet of Things (IoT) environment, a major portion of the FL clients may face low resource availability (e.g., lower computational power, limited bandwidth, and battery life). Consequently, the resource-constrained FL clients may give a very slow response, or may be unable to execute expected number of local iterations. Further, any FL client can inject inappropriate model during a training phase that can prolong convergence time and waste resources of all the network clients. In this paper, we propose a novel tri-layer FL scheme, Federated Proximal, Activity and Resource-Aware 31 Lightweight model (FedPARL), that reduces model size by performing sample-based pruning, avoids misbehaved clients by examining their trust score, and allows partial amount of work by considering their resource-availability. The pruning mechanism is particularly useful while dealing with resource-constrained FL-based IoT (FL-IoT) clients. In this scenario, the lightweight training model will consume less amount of resources to accomplish a target convergence. We evaluate each interested client's resource-availability before assigning a task, monitor their activities, and update their trust scores based on their previous performance. To tackle system and statistical heterogeneities, we adapt a re-parameterization and generalization of the current state-of-the-art Federated Averaging (FedAvg) algorithm. The modification of FedAvg algorithm allows clients to perform variable or partial amounts of work considering their resource-constraints. We demonstrate that simultaneously adapting the coupling of pruning, resource and activity awareness, and re-parameterization of FedAvg algorithm leads to more robust convergence of FL in IoT environment.


Sign in / Sign up

Export Citation Format

Share Document