路由对策的算法研讨.pdf

Abstract into articlestudiedhuman thetrafficnetwork Introducing graphtheory,this choiceswhile themaximum shortest minimumcost considering flow,the path，the networkon flowbasedon havemadefurtherresearchinthe howthe graphtheory．We humanchoosetheirOW／1routeinthe detailsareasthe sections： game．All following Thefirst withthenetworkflow the model，we part，tobegin exploredproblems of flowandtheNash flowandofferedaneffective optimal equilibrium algorithm．In thelimited couldfetchthemaximumflow side- capacitynetwork，we byintroducing thatthemaximumflowisexitbutnot model，andaconclusion unique． path caught modelof can onthemaximumflow the Depending network，wequicklyjudge whetherthe networkisafeasibleflowornot．Whenafeasible given flow given flow theeffective to flowandNash network canuse stream，we algorithmgetoptimal flowofthefeasibleflowand the thattheeffective equilibrium proveproblem ofhowto Nash flowis algorithm get equilibriumNP-completeproblems． Thesecond the of information section，we studyprice