This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

11institutetext: University of Klagenfurt, Klagenfurt, 9020, Austria
11email: {dario.blanco, stephan.leitner, alexandra.rausch}@aau.at

Multi-level Adaptation of Distributed Decision-Making Agents in Complex Task Environments

Darío Blanco-Fernández (✉) 0000-0002-8275-701X    Stephan Leitner 0000-0001-6790-4651    Alexandra Rausch 0000-0002-9275-252X
Abstract

To solve complex tasks, individuals often autonomously organize in teams. Examples of complex tasks include disaster relief rescue operations or project development in consulting. The teams that work on such tasks are adaptive at multiple levels: First, by autonomously choosing the individuals that jointly perform a specific task, the team itself adapts to the complex task at hand, whereby the composition of teams might change over time. We refer to this process as self-organization. Second, the members of a team adapt to the complex task environment by learning. There is, however, a lack of extensive research on multi-level adaptation processes that consider self-organization and individual learning as simultaneous processes in the field of management science. We introduce an agent-based model based on the NK-framework to study the effects of simultaneous multi-level adaptation on a team’s performance. We implement the multi-level adaptation process by a second-price auction mechanism for self-organization at the team level. Adaptation at the individual level follows an autonomous learning mechanism. Our preliminary results suggest that, depending on the task’s complexity, different configurations of individual and collective adaptation can be associated with higher overall task performance. Low complex tasks favour high individual and collective adaptation, while moderate individual and collective adaptation is associated with better performance in case of moderately complex tasks. For highly complex tasks, the results suggest that collective adaptation is harmful to performance.

Keywords:
Adaptation Complex tasks Agent-based modeling.

1 Introduction

Disaster relief rescue operations [18], or project development in consulting firms [3] are examples of tasks that can be characterized as complex tasks. These and many other complex tasks have two characteristics in common: (i) A single individual alone usually cannot find a solution to complex tasks, as the capabilities required to solve them are greater in scope than the ones a single individual possesses [5], and (ii) complex tasks are formed by various subtasks that are interdependent [7].

Individuals are required to coordinate and share their capabilities to solve complex tasks. We refer to this process as team formation [17]. Team formation often occurs autonomously, i.e., agents form teams by themselves and without the direct intervention of a central planner or decision-maker [12]. Giving individuals the possibility to autonomously organize themselves into teams can, for example, be found in firms that engage in consulting work [3], or professional services firms that are organized as a partnership (such as law or accounting firms) [6].

Teams that engage in complex problem solving might be dynamic in their composition, as they change by adapting to the particular task they face [3]. Adaptation at the team level is referred to as collective adaptation. However, not only the team as a collective adapts but also the individual agents (who make up a team) adapt by learning [3] (i.e., agents go through a process of individual adaptation). Thus, a team that is formed to solve a complex task goes through a continuous multi-level adaptation process. By successfully adapting at the individual and collective level to a particular complex task, the team’s performance is expected to improve [4].

Previous research indicates that individual agents adapt their capabilities to the task requirements by learning about the task they face [2], becoming more capable of performing the task, and thus improving the overall task performance [4]. To model individual adaptation, we consider a learning approach that can be characterized as autonomous. Learning is autonomous when it occurs without any interaction between agents, or a central agent who can take the role of a supervisor or a teacher. Similar autonomous approaches to learning can be found in [10, 11].

Individual agents are endowed with the ability to adapt and to autonomously form teams. Research in economics and management science often assumes that agents are homogeneous (i.e., following the concept of the representative agent) [1]. This assumption implies that any collective (e.g., a team) is just the aggregation of a set of homogeneous agents; and allows to study collective adaptation similarly to individual learning, since teams can be treated as uniform entities that go through a process of learning [15]. However, the notion of homogeneity in agents poses a problem, as this assumption is rather unrealistic and does not reflect real-life settings properly: Individuals usually differ in their characteristics [1]. In contrast, by considering heterogeneous agents, we drop this restrictive assumption and give this research a more realistic perspective [20]. Moreover, it also allows for implementing collective adaptation as a process differing from just the aggregation of individual learning dynamics. For example, by autonomously forming and recurrently reorganizing teams, a continuous process of collective adaptation emerges by reconsidering the role of the current members of the team against other potential members with different capabilities [8]. A significant branch of the previous literature concerning team self-organization has implemented auction-based mechanisms for team formation, in which an auction is held and the highest bidders are selected to form the team [16]. We consider collective adaptation as a self-organization process which follows an auction-based approach.

It seems reasonable to think that more adaptation is always positive for performance. However, in contrast to popular belief, more knowledge can be a burden. Previous research has shown that individual learning is beneficial for task performance, but only up to a threshold [11, 13]. Moreover, researchers argue that recurrent team self-organization can be harmful to performance in certain circumstances [8]. This is related to the exploration vs exploitation dilemma, which states that individuals should adequately balance searching for new solutions (i.e., exploration) against building on the solutions already at their disposal (i.e., exploitation) [13]. According to [11], the emergence of new solutions is positive for performance only at early stages of task-solving. However, at later stages, acquiring new solutions instead of building on the current ones known can lead to sub-optimal situations in terms of task performance [11]. We consider a multi-level perspective on this dilemma: Exploration can be increased (decreased) either by increasing individual learning or by self-organizing the team more often. Both actions imply that the team is actively looking for new solutions. Decreasing individual learning or self-organization, in turn, can be associated with more exploitation of the current solutions available.

Given the vast range of complex tasks in real-life settings [3, 9, 18], it is important to understand the relationship between simultaneous adaptation at multiple levels and complex task performance. While research on multi-level adaptation for task solving can be found in fields such as physics [8], it has not been extensively studied in the field of management science. This is done due to the fact that the micro and the macro-level (i.e., the individual and the team level) of the studied systems have been traditionally considered separately, and the literature that unifies both into a single framework is relatively scarce [14]. This aspect points at a significant research gap that we aim to fill. By implementing a multi-level adaptation approach to a practical management science problem, our objective is to understand better how simultaneous individual and collective adaptation affect task performance. To do so, we propose an agent-based model based on the NK-framework for management science [11] and perform a simulation study. This paper is structured as follows: Sec. 2 discusses the model and its most important aspects. Results are presented in Sec. 3. Finally, Sec. 4 provides a discussion of the results and potential avenues for future research.

2 Model

We model situations in which a population of PP\in\mathbb{N} agents faces a task of NN\in\mathbb{N} binary choices (see Sec. 2). The agents’ capabilities are limited in the following two ways: (i) Single agents cannot solve the task on their own, so they have to collaborate with other agents in a team consisting of M<PM\in\mathbb{N}<P members to jointly find a solution to the task; and (ii) agents cannot evaluate the entire set of possible solutions simultaneously. To overcome limitation (i), agents are endowed with the capability of recurrently self-organizing into a team (see Sec. 2). Concerning limitation (ii), we endow the agents with the capability of adapting to the task environment by sequentially exploring the solution space and learning new solutions in the process. We refer to this process as individual adaptation (see Sec. 2). The model architecture is illustrated in Fig. 1. We observe for t={1,,T}t=\{1,\dots,T\}\subset\mathbb{N} periods, how individual and collective adaptation affect task performance and interact.

Refer to caption
Figure 1: Model architecture

Task environment and agents

We base the task environment on the NK-framework [11] and formalize the complex decision problem, which agents face, by the string 𝐝=(d1,,dN)\mathbf{d}=(d_{1},\dots,d_{N}), where dn{0,1}d_{n}\in\{0,1\} for n={1,,N}n=\{1,\dots,N\}\subset\mathbb{N}. Since agents are limited in their capabilities (see Sec. 2), we segment the decision problem into MM parts of equal size S=N/MS\in\mathbb{N}=N/M. Within the team, agent m={1,,M}m=\{1,\dots,M\}\subset\mathbb{N} is responsible for the subtasks 𝐝m=(dS(m1)+1,,dSm)\mathbf{d}_{m}=(d_{S\cdot(m-1)+1},\dots,d_{S\cdot m}). Each decision dnd_{n} is associated with a performance contribution f(dn)U(0,1)f(d_{n})\sim U(0,1). K0K\in\mathbb{N}_{0} interdependencies among decisions did_{i} shape the complexity of the task 𝐝\mathbf{d}, so that performance contribution f(dn)f(d_{n}) might not only be affected by dnd_{n} but also by KK other decisions. KK represents the complexity of the overall task. We formalize the corresponding pay-off function by

f(dn)=f(dn,di1,,diK)Kinterdependencies,f(d_{n})=f(d_{n},\underbrace{d_{i_{1}},\dots,d_{i_{K}})}_{K\textrm{interdependencies}}~, (1)

where {i1,,iK}{1,,,n1,n+1,,N}\{i_{1},\dots,i_{K}\}\subseteq\{1,\dots,,n-1,n+1,\dots,N\}, and 0KN10\leq K\leq N-1. To compute performance landscapes111For a detailed discussion of the resulting landscapes’ characteristics, the reader might consult [11] of different complexity based on Eq. 1, we consider the stylized interdependence structures illustrated in Fig. 2.

Refer to caption
Figure 2: Stylized interdependence structures

We denote agent mm’s solution to their problem 𝐝m\mathbf{d}_{m} and the solution to the entire problem 𝐝\mathbf{d} at time step tt by 𝐝mt\mathbf{d}_{mt} and 𝐝t\mathbf{d}_{t}, respectively. We compute agent mm’s performance in tt according to

ϕ(𝐝mt)=1Sdnt𝐝mtf(dnt)\phi(\mathbf{d}_{mt})=\frac{1}{S}\sum_{d_{nt}\in\mathbf{d}_{mt}}f(d_{nt})~ (2)

and the performance associated with the solution of the the team of MM agents by

Φ(𝐝t)=1Mm=1Mϕ(𝐝mt)=1Nn=1Nf(dnt).\Phi(\mathbf{d}_{t})=\frac{1}{M}\sum_{m=1}^{M}\phi(\mathbf{d}_{mt})=\frac{1}{N}\sum_{n=1}^{N}f(d_{nt})~. (3)

Agent mm’s utility in time step tt includes the performance of their subtasks 𝐝m\mathbf{d}_{m} and the residual performance coming from the other M1M-1 agents’ decisions 𝐃m=(𝐝1,,𝐝r)\mathbf{D}_{m}=(\mathbf{d}_{1},\dots,\mathbf{d}_{r}), where r={1,,M}r=\{1,\dots,M\} and rmr\neq m. Agent mm’s utility in tt follows the linear function

U(𝐝mt,𝐃mt(𝐝1t,,𝐝rt))=αϕ(𝐝mt)+β1M1r=1rmMϕ(𝐝rt),U(\mathbf{d}_{mt},\underbrace{\mathbf{D}_{mt}}_{(\mathbf{d}_{1t},\dots,\mathbf{d}_{rt})})=\alpha\cdot\phi(\mathbf{d}_{mt})+\beta\cdot\frac{1}{M-1}\sum_{\begin{subarray}{c}r=1\\ r\neq m\end{subarray}}^{M}\phi(\mathbf{d}_{rt})~, (4)

where α\alpha\in\mathbb{R} and β\beta\in\mathbb{R} indicate the weights for agent mm’s own and residual performances, respectively, and α+β=1\alpha+\beta=1. The objective of the agents is to maximize the utility function U(𝐝mt,𝐃mt)U(\mathbf{d}_{mt},\mathbf{D}_{mt}) at each time step tt.

Adaptation at the individual level

Since agents face binary choices, there are S2S^{2} possible solutions for each subtask. Agents are limited as they do not know the entire solution space within their subtask. Initially, they only know a subset of Q<S2Q\in\mathbb{N}<S^{2} solutions. Agents are homogeneous concerning the capacity QQ and heterogeneous with respect to the QQ solutions they actually know. We endow agents with the capability of adapting to their subtask environment that is defined by their decision problem 𝐝m\mathbf{d}_{m} (see Fig. 1). With probability pp, agents randomly learn an unknown solution to 𝐝m\mathbf{d}_{m} that differs in the value of only one decision dn{d}_{n} from the set of currently known solutions. Since capabilities are limited, with probability pp, agents also erase from their memory (i.e., forget) solutions they do not frequently use due to the low level of associated utility. The implemented adaptation follows an autonomous learning approach that can be found in previous implementations of the NK-framework [10].

Adaptation at the collective level

We assume that the population of PP agents is equally distributed across MM subtasks so that for each subtask, there are J=P/MJ\in\mathbb{N}=P/M agents who can find a solution to this subtask. Consequently, JJ agents compete for a slot in the team; and all PP agents autonomously organize themselves in a team finally composed of MM agents. The self-organizing process follows the concept of a second-price auction and always occurs at timestep t=1t=1. Afterwards, τ1\tau-1 other auctions are held over the remaining T1T-1 time steps in regular intervals, so for t>1t>1, auctions are held each time tmodTτ=0t\mod\frac{T}{\tau}=0. This means that τ\tau auctions take place over the considered time horizon TT each Tτ\frac{T}{\tau} time steps.

We implement this second-price auction process in the following way: To become a team member, agents place bids. These bids represent what agents intend to contribute to team performance. Since the selection mechanism follows a second-price auction, agents have incentives to reveal their true contributions [19]. Agents, however, cannot observe the other agents’ bids and this is why they assume the residual decisions 𝐃mt1\mathbf{D}_{mt-1} will remain constant from implemented solution at t1t-1. Agents compute the expected utilities for all their solutions to their subtasks 𝐝m\mathbf{d}_{m} available in time step tt according to U(𝐝mt,𝐃mt1)U(\mathbf{d}_{mt},\mathbf{D}_{mt-1}) (see Eq. 4). Each agent submits the highest attainable expected utility among the different solutions as their bid in tt. Consequently, there are JJ bids for each slot in the team. Following the logic of second-price auctions, the team comprises those agents MM who submit the highest proposals per slot. For being a part of the team, agents are charged the second-highest bid per slot.222Since agents only experience utility if they are team members, they always have incentives to participate in this process.

Decision-making process

In each time step tt, the MM team members are tasked with finding a solution 𝐝𝐭\mathbf{d_{t}} to the complex task 𝐝\mathbf{d}. Agents are autonomous in their decisions, and there is no communication or coordination between agents. The decision-making process is a two-stage process. First, each agent mm focuses on their subtask 𝐝mt\mathbf{d}_{mt} and computes the expected utility for each solution available in this particular time step. Since we do not allow for communication, the agents assume that the residual decisions do not change compared to the previous period 𝐃mt1\mathbf{D}_{mt-1}. The expected utility is computed by U(𝐝mt,𝐃mt1)U(\mathbf{d}_{mt},\mathbf{D}_{mt-1}) (see Eq. 4) for each solution known. The agent chooses the solution that promises the highest utility. In the first step, each agent comes up with an SS binary values vector that represents the solution to their subtask. Second, once all agents have submitted their solutions, the overall solution is computed by concatenating each of the MM solutions chosen by the agents. The solution to the complex problem in tt, 𝐝t,\mathbf{d}_{t}, is thus represented by a vector of NN binary values. We compute the performance of the overall solution according to Eq. 3, and agents receive the resulting utility according to Eq. 4.

Scenarios, variables and sequencing of the model

An overview of the model’s variables and the values they can take is given in Tab. 1. With the values provided in Tab. 1 for the number of auctions that occur at each simulation, we identify three different scenarios. First, for τ=1\tau=1, there is initial collective adaptation: The auction process occurs only at the first period, never to be repeated. Second, for τ=20\tau=20, there is moderate collective adaptation, with the team self-organizing each Tτ=10\frac{T}{\tau}=10 time steps. Finally, for τ=200\tau=200, there is high collective adaptation, with the team self-organizing at each time step.

Table 1: Variables of the model
Type Description Denoted by Values
Exogenous variable Complexity KK {3,5,11}\{3,5,11\}
Probability of individual adaptation pp {0,0.1,0.2,0.3,0.4,0.5}\{0,0.1,0.2,0.3,0.4,0.5\}
Number of auctions held τ\tau {1,20,200}\{1,20,200\}
Observed variable Team performance CtC_{t} [0,,1]\in[0,…,1]
Other variables Time steps tt [0,,200]\in[0,…,200]
Temporal horizon TT 200200
Number of decisions NN 1212
Weights of utility α\alpha, β\beta 0.50.5
Simulation runs RR 1,500
Number of subtasks MM 33

Fig. 3 provides an overview of the events of the model in order.

Refer to caption
Figure 3: Sequence of events during simulation runs

3 Results

Performance measure

During each simulation run rr and timestep tt, the team performance Φ(𝐝t)\Phi(\mathbf{d}_{t}) is normalized by the highest possible performance in that simulation run, max(Φr)max(\Phi_{r}). Based on this measure, we compute the average performance of the scenario for each timestep tt as follows:

Φt~=1Rt=1TΦ(𝐝𝐭)max(Φr).\tilde{\Phi_{t}}=\frac{1}{R}\sum_{t=1}^{T}\frac{\Phi(\mathbf{d_{t}})}{max(\Phi_{r})}~. (5)

We further condense the average distance per timestep, Φt~\tilde{\Phi_{t}}, to the total Manhattan Distance. This means that we compute the difference at each time step tt between average performance Φt~\tilde{\Phi_{t}} and the maximum performance max(Φr)max(\Phi_{r}). Then each difference is summed over the TT time steps333Note that since performance has been normalized using Eq. 5 and then averaged, then the maximum performance is max(Φr)=1max(\Phi_{r})=1.. We formalize the total Manhattan Distance MD as follows:

MD=t=1T(1Φt~)\textit{MD}=\sum^{T}_{t=1}{(1-\tilde{\Phi_{t}})} (6)

Please note that a higher Manhattan Distance MD implies a higher average distance to the maximum, and thus a lower overall performance.

In Fig. 4, we plot the Manhattan Distance for each studied scenario. The x-axis of each subplot represents the probability of individual adaptation. On the y-axis, we plot the three scenarios considered for collective adaptation (see Sec. 2, Scenarios, variables and sequencing of the model). The three subplots represent the results for different complexity levels (see Fig. 1). Each point of the subplots represents a total Manhattan Distance MD for a particular configuration of individual and collective adaptation. A point located in a lighter (darker) area implies lower (higher) MD, and thus a better (worse) performance.

Refer to caption
Figure 4: Contour plots for the total Manhattan Distance MD.

Individual adaptation

The results suggest that the probability of individual adaptation pp has a considerable effect on task performance. In particular, we observe a substantial decrease in the total Manhattan Distance MD, when agents are capable of learning, i.e., when p>0p>0. This pattern is robust across all considered interdependence structures (i.e., for each level of KK considered), as shown in all three contour plots of Fig. 4. The effect of agents being capable of learning on performance is highly significant, suggesting that promoting learning, even if it is just minimal, is always beneficial for task performance.

Regarding p>0.1p>0.1, it can be observed in low complexity scenarios (i.e., the left plot of Fig. 4) that there is a decreasing marginal positive effect of individual adaptation on performance: Each successive increase in pp increases task performance less than the previous increase did. For example, the effect on the average task performance of increasing the probability of individual adaptation from p=0.1p=0.1 to p=0.5p=0.5 is lower in magnitude than the effect of increasing the probability from p=0p=0 to p=0.1p=0.1 for all three collective adaptation scenarios considered. Starting to learn about a task has huge implications on performance. However, each increase that occurs in individual adaptation reduces the overall impact of individual learning on performance, even if this effect is still positive.

However, for higher levels of complexity (see the central and right panels of Fig. 4), this positive effect eventually turns negative, and the overall performance declines as a result. For example, in the central plot of Fig. 4 (i.e., for K=5K=5) we observe how a team with high collective adaptation reaches its lowest total distance of MD=20.00MD=20.00 at a learning probability of p=0.1p=0.1. Further increases in individual adaptation appear to affect performance negatively, surpassing MD=25.00MD=25.00 for p=0.5p=0.5. Eventual decreases in performance can also be observed for moderate collective adaptation and for initial collective adaptation (both for p>0.4p>0.4). This pattern of initial growth but with an eventual decline in performance is even more pronounced in scenarios of high complexity (i.e., K=11K=11, see the right panel of Fig. 4). Results imply that, for moderate or high levels of complexity, individual adaptation and task performance are related in the form of an inverted-U: Initial increases in individual adaptation are positive for task performance, although the positive effect decreases in magnitude with each successive increase. Eventually, the relationship turns negative and performance is harmed as a consequence of increasing individual adaptation.

Collective adaptation

The results suggest that whether collective adaptation has a positive or negative impact on performance depends on the complexity of the scenario studied. For low levels of complexity (represented by the left panel of Fig. 4), we can observe that high collective adaptation is associated with higher performance as compared to scenarios with either moderate or initial collective adaptation (except for p=0p=0, in which all three teams perform very similarly, and p=0.1p=0.1, in which high and moderate collective adaptation perform similarly). Moreover, the highest possible performance in low complexity scenarios considered is attained by a team exhibiting high collective adaptation, reaching a total distance below MD=1.00MD=1.00 for p=0.5p=0.5. When facing a task that is not highly complex, it is beneficial in terms of performance to increase the effort dedicated to finding new solutions (i.e., increasing exploration), at both the individual and collective level.

However, in scenarios with medium complexity (represented by the central panel of Fig. 4), for most values of pp, moderate collective adaptation leads to higher performances compared to both high or initial collective adaptation scenarios. There are two exceptions to this, which are for the extreme values of p=0p=0 (in which moderate and high collective adaptation perform very similarly) and p=0.5p=0.5 (in which moderate and initial collective adaptation perform very similarly). For 0<p<0.50<p<0.5, moderate collective adaptation is associated with a higher performance than any other alternative. Moreover, the highest attainable performance in all medium complexity scenarios considered occurs for moderate collective adaptation and p=0.4p=0.4 and is around MD=15.00MD=15.00. In contrast to low complexity scenarios (except for the extreme case of p=0p=0, in which agents do not learn at all), high collective adaptation is always associated with the lowest performance compared to the other two alternatives. The results suggest that increasing exploitation (exploration) excessively via decreasing (increasing) collective adaptation can be harmful to performance. Moderate collective adaptation, in turn, benefits performance in the majority of cases.

Results in scenarios of high complexity, as shown in the right panel of Fig. 4, suggest that increasing collective adaptation is detrimental to performance when individual learning occurs (i.e., for p>0p>0). An exception to this occurs in the extreme case of p=0.5p=0.5, in which initial and moderate collective adaptation are associated with a similar performance around MD=43.00MD=43.00. For 0<p<0.50<p<0.5, initial collective adaptation is associated with a higher performance than any other of the alternatives. Furthermore, the highest attainable performance for high complexity scenarios is attained by a team with initial collective adaptation and p=0.2p=0.2, for approximately MD=38.00MD=38.00. When tasks are highly complex, stability in team composition is favoured, since the recurrent reorganization of a team eventually impairs task performance.

Discussion

This research is concerned with multi-level adaptation and its relationship with task performance in teams. Results indicate that, in low complexity environments, putting a lot of effort into adaptation at both the collective and the individual level is not detrimental in terms of performance. This extends the insights given by [11] about adaptation in complex environments: When facing a task of low complexity, high exploration does not decrease the overall task performance, since there are lower chances of ending in sub-optimal, long-term solutions. Since only a single level at which adaptation occurs was considered in [11], our results contribute to previous research by showing that this is the case also for multi-level settings.

For moderate levels of complexity, our results show that the exploration vs exploitation dilemma can also be applied in a multi-level adaptation setting; and that a proper balance between exploration and exploitation is the key to improving task performance in teams. Thus, these insights are in line with previous research [11, 13, 15, 21] regarding the exploration vs exploitation dilemma. The main difference to the previous literature is that, in our research, exploration can be increased either by increasing individual or collective adaptation. In particular, when considering moderately complex tasks, the results suggest that for performance to improve, moderate individual learning has to be combined with moderate collective adaptation. The reported findings are consistent with previous results, which indicate that recurrent self-organization of teams combined with individual learning can be associated with higher task performance [8]. In real-life settings this moderate adaptation at both levels could be achieved, for example, by allowing employees of a firm to dedicate a limited amount of working hours to self-education and training; combined with holding regular team meetings with employees outside the team to discuss the state of the task and what other members could contribute to it.

Given these results for low and moderate complexity, it can be concluded that recurrent self-organization can be beneficial to task performance. These insights are in contrast with views in the field of management science that characterize team reorganization as harmful to performance [9]. In particular, team stability has been associated with high degrees of team-level learning and, eventually, higher performance [9]. In this context, adaptation occurs just at the team level, following a learning process for the collective. This highlights the importance of considering multi-level adaptation, as done in our research. By considering multiple, simultaneous adaptation processes (in this case, by endowing agents with the capabilities of learning and combined with recurrent team self-organization), emerging insights into topics such as team reorganization differ from those found in the previous literature. Since adaptation has been considered as occurring at multiple levels in the previous literature [13], we believe that these findings and similar implementations help us to understand better the relationship between adaptation and task solving in teams and to relate it to real-life problems.

Our results also contribute to the literature on multi-level adaptation and task performance when considering highly complex tasks. Previous research on multi-level adaptation and task performance (which is, in itself, not extensive) has not considered highly complex tasks (see, for example, [8]). Thus, we can consider our results as a first step in the matter of studying multi-level adaptation under high complexity. We find that, in highly complex tasks, collective adaptation is negative for performance, and that the positive effect of individual adaptation is limited considerably. As the previous literature shows, highly complex environments are associated with lower benefits for exploration, since the probability of finding sub-optimal, long-term solutions is very high [11]. Again, our results can be understood as extensions to previous insights on the exploration vs exploitation dilemma by considering multi-level adaptation.

This set of results provides an extension to approaches that consider a single level of adaptation [11, 13, 15, 21]. The value of our research lies in the fact that it provides a discussion on individual and collective adaptation, both separately and simultaneously. To our knowledge, there is a lack of an extensive implementation of a multi-level adaptation approach that considers autonomous individual learning and team self-organization in management science. By considering these two aspects, we believe that this research provides a novel approach to multi-level adaptation in this field. Our results should then be understood as both complementary to previous findings in the literature and as an extension to them [11, 21].

4 Conclusion

Individual and collective adaptation are two factors that strongly determine the performance of a task. In particular, we have found that regarding low complexity tasks, pushing for high individual and collective adaptation is associated with a better task performance. However, this is changed by increasing complexity. When tasks are moderately complex, teams have to combine individual learning up to a threshold with moderately recurrent team self-organization to reach the highest attainable performance. If the task is highly complex, then low individual learning combined with no collective adaptation is the best alternative in terms of task performance. These aspects provide evidence for the exploration vs exploitation dilemma also holds true when considering multi-level adaptation.

However, we must note that there are some limitations to our research. For example, the importance of coordination and communication is not addressed [21], and neither we do consider the potential costs that individual and collective adaptation might incur. Further extensions of the model include endowing agents with the capabilities of choosing more or less individual adaptation [7] or breaking up the formed team [8], and including alternative mechanisms of adaptation such as social learning [2]. The implementation of these and others aspects might help in extending our research. Moreover, the results suggest the existence of an interaction effect between adaptation at multiple levels, as increasing adaptation at both levels simultaneously can eventually lead to having ”too much exploration” and decreasing task performance. Further extensions of this research can cover this aspect. Considering these limitations and potential extensions, we believe this paper and its results can serve as a first step towards the study of multi-level adaptation and its effects on performance. Moreover, it also serves as a departure point for future research on the topic of multi-level adaptation and complex task performance in teams.

References

  • [1] Axtell, R.L.: What economic agents do: How cognition and interaction lead to emergence and complexity. Review of Austrian Economics 20(2-3), 105–122 (2007)
  • [2] Baumann, O., Schmidt, J., Stieglitz, N.: Effective search in rugged performance landscapes: A review and outlook. Journal of Management 45(1), 285–318 (2019)
  • [3] Creplet, F., Dupouet, O., Kern, F., Mehmanpazir, B., Munier, F.: Consultants and experts in management consulting firms. Research Policy 30(9), 1517–1535 (2001)
  • [4] Eisenhardt, K.M., Martin, J.A.: Dynamic capabilities: What are they? Strategic Management Journal 21, 1105–1121 (2000)
  • [5] Funke, J., Frensch, P.A.: Complex problem solving research in North America and Europe : An integrative review. Foreign Psychology 5, 42–47 (1995)
  • [6] Gershkov, A., Li, J., Schweinzer, P.: Efficient tournaments within teams. RAND Journal of Economics 40(1), 103–119 (2009)
  • [7] Giannoccaro, I., Galesic, M., Francesco, G., Barkoczi, D., Carbone, G.: Search behavior of individuals working in teams : A behavioral study on complex landscapes. Journal of Business Research pp. 1–10 (2019)
  • [8] Gomes, P.F., Reia, S.M., Rodrigues, F.A., Fontanari, J.F.: Mobility helps problem-solving systems to avoid groupthink. Physical Review E 99(3), 1–10 (2019)
  • [9] Hsu, S.C., Weng, K.W., Cui, Q., Rand, W.: Understanding the complexity of project team member selection through agent-based modeling. International Journal of Project Management 34(1), 82–93 (2016)
  • [10] Leitner, S., Wall, F.: Multiobjective cecision making policies and coordination mechanisms in hierarchical organizations: Results of an agent-based simulation. The Scientific World Journal 2014, 1–12 (2014)
  • [11] Levinthal, D.A.: Adaptation on rugged landscapes. Management Science 43(7), 934–950 (1997)
  • [12] LiCalzi, M., Surucu, O.: The power of diversity over large solution spaces. Management Science 58(7), 1408–1421 (2012)
  • [13] March, J.G..: Exploration and exploitation in organizational learning. Organization Science 2(1), 71–87 (1991)
  • [14] Molloy, J.C., Ployhart, R.E., Wright, P.M.: The myth of ”the” micro-macro divide: Bridging system-level and disciplinary divides. Journal of Management 37(2), 581–609 (2011)
  • [15] Rivkin, J.W., Siggelkow, N.: Patterned interactions in complex systems: Implications for exploration. Management Science 53(7), 1068–1085 (2007)
  • [16] Rizk, Y., Awad, M., Tunstel, E.W.: Cooperative heterogeneous multi-robot systems: A survey. ACM Computing Surveys 52(2), 1–31 (2019)
  • [17] Simon, H.A.: Models of man, social and rational. John Wiley and Sons (1957)
  • [18] Tang, J., Zhu, K., Guo, H., Gong, C., Liao, C., Zhang, S.: Using auction-based task allocation scheme for simulation optimization of search and rescue in disaster relief. Simulation Modelling Practice and Theory 82, 132–146 (2018)
  • [19] Vickrey, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. The Journal of Finance 16(1), 8–37 (1961). https://doi.org/10.2307/2977633
  • [20] Wall, F.: Agent-based modeling in managerial science: an illustrative survey and study. Review of Managerial Science 10(1), 135–193 (2016)
  • [21] Wall, F.: Emergence of task formation in organizations: Balancing units’ competence and capacity. Journal of Artificial Societies and Social Simulation 21(2) (2018)