Optimal Tag-Based Cooperation Control for the “Prisoner’s Dilemma”

<div>The optimal identified rate <svg height="13.532pt" id="M725" style="vertical-align:-3.4295pt" version="1.1" viewbox="-0.0498162 -10.1025 27.2394 13.532" width="27.2394pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M558 587C558 666 497 712 432 712C379 712 330 691 284 650C212 586 178 508 148 348L71 -65C49 -185 35 -229 23 -235L27 -261C49 -259 101 -251 124 -224C131 -216 138 -178 159 -24C171 66 197 200 227 356C264 550 295 668 393 668C443 668 479 632 479 575C479 516 446 458 383 418C361 404 344 398 318 397L296 350C395 338 460 281 460 192C460 110 411 40 300 40C258 40 215 55 192 69L181 51C191 18 222 -16 266 -16C308 -16 351 1 397 26C471 67 545 142 545 221C545 315 486 365 401 395C469 437 558 498 558 587Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,7.554,-5.741)"><path d="M486 158C486 177 478 202 466 220C413 228 386 236 336 262C386 288 413 297 466 304C478 323 486 347 485 366C470 376 444 381 422 380C389 338 368 319 321 288C323 345 329 372 349 422C339 442 322 461 305 470C289 461 271 442 262 422C281 372 287 345 290 288C243 319 222 338 189 380C167 381 142 376 125 366C125 347 133 322 145 304C198 296 225 288 275 262C225 236 198 227 145 220C133 201 125 177 126 158C141 148 167 143 189 144C222 186 243 205 290 236C288 179 282 152 262 102C272 82 289 63 306 54C322 63 340 82 350 102C330 152 324 179 321 236C368 205 390 186 422 144C444 143 470 148 486 158Z"></path></g><g transform="matrix(.013,0,0,-0.013,13.633,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z"></path></g><g transform="matrix(.013,0,0,-0.013,18.131,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z"></path></g><g transform="matrix(.013,0,0,-0.013,22.564,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z"></path></g></svg> under different<span class="nowrap"><svg height="9.39034pt" id="M726" style="vertical-align:-3.42943pt" version="1.1" viewbox="-0.0498162 -5.96091 6.50656 9.39034" width="6.50656pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M474 429L457 433C435 440 389 448 367 448C348 448 323 446 309 443C266 434 195 406 148 366C78 307 23 210 23 101C23 35 55 -12 92 -12C118 -12 146 1 196 35C247 70 311 130 346 173H348L281 -148C268 -211 256 -221 208 -229L191 -232L187 -257L433 -245L437 -219L411 -216C357 -210 350 -205 362 -140L427 207C447 315 461 381 474 429ZM387 387C379 337 363 262 355 236C318 180 201 57 142 57C126 57 112 81 112 128C112 205 150 321 220 376C244 395 280 403 312 403C345 403 370 396 387 387Z"></path></g></svg>.</span></div>

Complexity

fig2

Figure 2

Figure 2: Optimal Tag-Based Cooperation Control for the “Prisoner’s Dilemma” 