A Two-Sided Matching Decision Model Based on Uncertain Preference Sequences

Matching sets <svg height="8.68572pt" id="M309" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 10.0819 8.68572" width="10.0819pt" 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="M748 650H522L515 622L546 617C580 611 587 604 565 575C518 513 469 451 419 393C376 474 349 534 330 580C318 609 325 612 361 618L383 622L392 650H151L144 622C214 616 224 612 257 543L360 327C270 218 187 124 159 95C106 40 92 34 26 28L17 0H252L259 28L236 31C189 37 188 47 209 78C249 136 308 210 377 294L478 79C494 44 487 37 449 32L418 28L409 0H673L680 28C596 34 591 39 554 116L436 361C526 469 574 521 604 553C659 612 669 614 739 622L748 650Z" id="g113-89"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="765" vert-adv-y="765"></glyph.data></g></svg> and <svg height="8.68572pt" id="M310" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 8.6074 8.68572" width="8.6074pt" 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="M640 650H413L406 622L438 617C475 611 483 605 463 571C422 503 346 400 296 333C264 403 215 529 199 575C189 604 191 614 228 618L262 622L271 650H30L23 622C90 615 97 609 119 553L212 321C222 295 223 285 218 259L193 127C176 39 167 33 82 28L76 0H350L356 28C266 36 257 40 275 127L303 266C308 290 314 302 328 322C396 418 454 493 498 546C551 610 565 616 631 622L640 650Z" id="g113-90"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="652" vert-adv-y="652"></glyph.data></g></svg>  and preference sequences <svg height="8.68572pt" id="M311" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 8.15071 8.68572" width="8.15071pt" 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 480C600 590 528 650 384 650H143L137 622C222 614 225 607 210 531L130 127C113 41 106 36 23 28L17 0H294L300 28C204 36 195 42 212 127L243 284L314 263C327 263 339 263 352 264C465 271 600 337 600 480ZM508 481C508 351 402 304 329 304C289 304 265 311 250 317L295 559C302 594 310 606 323 611C335 616 350 619 367 619C455 619 508 573 508 481Z" id="g113-81"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="617" vert-adv-y="617"></glyph.data></g></svg> and <svg height="10.7866pt" id="M312" style="vertical-align:-2.150701pt" version="1.1" viewbox="-0.0498162 -8.6359 9.52083 10.7866" width="9.52083pt" 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="M699 368C699 549 574 666 407 666C186 666 23 488 23 277C23 113 129 -3 288 -13L307 -26C431 -111 501 -139 533 -147C559 -154 613 -163 658 -164L666 -141C597 -111 507 -66 430 -11L416 -1C580 42 699 190 699 368ZM601 371C601 227 518 54 381 22L354 40L278 24C175 47 120 145 120 269C120 451 235 631 398 631C540 631 601 521 601 371Z" id="g113-82"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="722" vert-adv-y="722"></glyph.data></g></svg> in Case 1.

Mathematical Problems in Engineering

tab1

Table 1

Table 1: A Two-Sided Matching Decision Model Based on Uncertain Preference Sequences 