A Framework for Online Reverse Auction Based on Market Maker Learning with a Risk-Averse Buyer

<table class="table-group" id="tab4"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td class="align_left">Description</td><td class="align_center">Parameter</td><td class="align_center">Value</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td class="align_left">Maximum number of iterations</td><td class="align_center"><span style="width: 5.68448ptpx;"><svg height="8.68572pt" id="M62" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 5.68448 8.68572" width="5.68448pt" 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="M405 650H141L135 622C222 616 230 610 215 535L133 116C118 41 113 33 29 28L23 0H289L295 28C209 33 205 40 219 116L298 535C312 609 317 616 399 622L405 650Z"></path></g></svg></span></td><td class="align_center">50</td></tr><tr><td class="align_left">Number of sellers</td><td class="align_center"><span style="width: 6.6501ptpx;"><svg height="6.1673pt" id="M63" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 6.6501 6.1673" width="6.6501pt" 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="M495 86L479 114C446 82 419 66 409 66C401 66 401 72 406 97C420 166 436 231 453 297C489 435 454 448 428 448C406 448 384 439 354 422C305 394 222 327 161 247H159L183 345C200 415 194 448 173 448C143 448 82 410 23 351L38 325C64 349 95 371 105 371C111 371 116 365 109 336L25 -4L31 -12C50 -4 77 3 107 9C119 69 132 122 145 168C197 254 321 381 370 381C387 381 393 374 378 305L329 95C309 17 320 -12 345 -12C372 -12 430 19 495 86Z"></path></g></svg></span></td><td class="align_center">6</td></tr><tr><td class="align_left">Improvement threshold</td><td class="align_center"><span style="width: 13.7626ptpx;"><svg height="11.927pt" id="M64" style="vertical-align:-3.291101pt" version="1.1" viewbox="-0.0498162 -8.6359 13.7626 11.927" width="13.7626pt" 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="M600 0V24L339 665L311 657L43 24V0H600ZM497 50H107L303 539L497 50Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,9.958,3.132)"><path d="M329 433H203L239 587L230 596L147 534L123 433H57L30 395L34 388H115L61 129C37 16 59 -12 85 -12C147 -12 222 58 260 98L241 125C212 95 160 62 144 62C132 62 127 71 138 126L192 386L305 394L329 433Z"></path></g></svg></span></td><td class="align_center">0.05</td></tr><tr><td class="align_left" rowspan="3">Risk-aversion cost function</td><td class="align_center"><span style="width: 6.59789ptpx;"><svg height="9.49473pt" id="M65" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 6.59789 9.49473" width="6.59789pt" 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="M475 507C475 612 440 712 326 712C139 712 23 420 23 215C23 96 58 -12 180 -12C369 -12 475 293 475 507ZM391 522C391 486 387 448 379 394H126C155 538 222 677 310 677C386 677 391 571 391 522ZM373 346C344 193 283 22 189 22C126 22 106 114 106 196C106 243 111 293 118 346H373Z"></path></g></svg></span></td><td class="align_center">2</td></tr><tr><td class="align_center"><span style="width: 7.51131ptpx;"><svg height="6.1673pt" id="M66" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 7.51131 6.1673" width="7.51131pt" 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="M545 106L524 126C493 85 467 65 455 65C438 65 427 113 405 238C448 295 498 362 543 439L533 448L478 435C453 386 423 331 398 295H395C370 404 347 448 282 448C169 448 23 309 23 153C23 54 65 -12 128 -12C203 -12 283 70 339 155H341C360 29 380 -12 411 -12C444 -12 491 11 545 106ZM333 204C265 95 210 54 169 54C137 54 113 96 113 171C113 302 191 405 252 405C301 405 318 306 333 204Z"></path></g></svg></span></td><td class="align_center">0.5</td></tr><tr><td class="align_center"><span style="width: 7.68094ptpx;"><svg height="12.7178pt" id="M67" style="vertical-align:-3.42947pt" version="1.1" viewbox="-0.0498162 -9.28833 7.68094 12.7178" width="7.68094pt" 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></svg></span></td><td class="align_center">0.5</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Mathematical Problems in Engineering

tab4

Table 4

Table 4: A Framework for Online Reverse Auction Based on Market Maker Learning with a Risk-Averse Buyer 