Core Deviation Minimizing Auctions

Hafalır, İsa Emin; Yektas, Hadi

doi:10.2139/ssrn.2001033

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, Roth (1982) notes that stable and efficient solutions are often different outcomes for matching markets, while the more recent work of Che and Tercieux (2019) shows asymptotic stability and efficiency as markets get large. Similarly, the trade‐off between stability and efficiency has been explored in the context of auctions, for example by Hafalir and Yekta (2015).…”

Section: Introductionmentioning

confidence: 99%

Balancing stability and efficiency in team formation as a generalized roommate problem

Yekta

Bergman

Day

2022

Naval Research Logistics

View full text Add to dashboard Cite

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra‐team interpersonal interactions are taken into consideration, and also due to game‐theoretic considerations, when those taking part in the process are self‐interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game‐theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi‐level binary optimization problem, and transformed into a single‐level, exponentially sized binary integer program. We then devise a branch‐cut‐and‐price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.

show abstract

Section: Introductionmentioning

confidence: 99%