ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

خوارزمية غيل-شابلي×آلية فيكري-كلارك-جروفز (VCG)×
المجالنظرية الألعابنظرية الألعاب
العائلةMachine learningMachine learning
سنة النشأة19621961
صاحب الطريقةDavid Gale, Lloyd ShapleyWilliam Vickrey, Edward Clarke, Theodore Groves
النوعalgorithmalgorithm
المصدر التأسيسيGale, D., & Shapley, L. S. (1962). College admissions and the stability of marriage. The American Mathematical Monthly, 69(1), 9-15. DOI ↗Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed bids. The Journal of Finance, 16(1), 8-37. DOI ↗
الأسماء البديلةStable Marriage Problem, Deferred Acceptance, Two-Sided MatchingVickrey Mechanism, Generalized Vickrey Auction, Truthful Mechanism
ذات صلة44
الملخصThe Gale-Shapley algorithm solves the stable marriage problem: how to match two groups (e.g., medical residents to hospitals, students to schools) such that no pair prefers each other to their assigned partners. Introduced by David Gale and Lloyd Shapley in 1962, the algorithm guarantees a stable matching in polynomial time through a deferred acceptance process where one side proposes sequentially and the other side responds, revising choices as better options arrive.The Vickrey-Clarke-Groves (VCG) Mechanism is a truthful mechanism design solution that allocates resources and determines payments to incentivize participants to reveal their true valuations. Building on William Vickrey's 1961 sealed-bid auction work and extended by Clarke and Groves, VCG ensures that reporting truth is a dominant strategy for all participants, achieving allocative efficiency while maximizing total surplus.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Gale-Shapley Algorithm · VCG Mechanism. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare