- 0
- 0
- 约2.72万字
- 约 15页
- 2026-01-14 发布于浙江
- 举报
外文翻译
原文1
MatchingModelsforPreference-sensitiveGroupPurchasing
Matchingbuyersandsellersisoneofthemostfundamentalproblemsineconomicsandmarketdesign.Aninterestingvariantofthematchingproblemariseswhenself-interestedbuyerscometogetherinordertoinducesellerstoofferquantityorvolumediscounts,asiscommoninbuyingconsortia,andmorerecentlyintheconsumergroupcouponingspace(e.g.,Groupon).Weconsiderageneralmodelofthisprobleminwhichagrouporbuyingconsortiumisfacedwithvolumediscountoffersfrommultiplevendors,butgroupmembershavedistinctpreferencesfordifferentvendorofferings.Unlikesomerecentformulationsofmatchinggamesthatinvolvequantitydiscounts,thecombinationofvaryingpreferencesanddiscountscanrenderthecoreofthematchinggameempty,inboththetransferableandnontransferableutilitysense.Thus,insteadofcoalitionalstability,weproposeseveralformsofNashstabilityundervariousepistemicandtransfer/paymentassumptions.Weinvestigatethecomputationofbuyer-welfaremaximizingmatchingsandshowtheexistenceoftransfers(subsidizedprices)ofaparticularlydesirableformthatsupportstablematchings.Wealsostudyanontransferableutilitymodel,showingthatstablematchingsexist;andwedevelopavariantoftheprobleminwhichbuyersprovideasimplepreferenceorderingover“deals”ratherthanspecificvaluations—amodelthatisespeciallyattractiveintheconsumerspace—whichalsoadmitsstablematchings.Computationalexperimentsdemonstratetheefficacyandvalueofourapproach.
CategoriesandSubjectDescriptors:I.2.11[DistributedArtificialIntelligence]:MultiagentSystems;J.4
[ComputerApplications]:SocialandBehavioralSciences—Economics
GeneralTerms:Algorithms,Economics,Theory
AdditionalKeyWordsandPhrases:stablematching,preferences,demandaggregation,grouppurchasing,volumediscounts,dailydeals,cooperativegames.
1.INTRO
原创力文档

文档评论(0)