Home
last modified time | relevance | path

Searched refs:payoffs (Results 1 – 25 of 86) sorted by relevance

1234

/dports/math/gambit/gambit-16.0.1/library/include/gambit/gtracer/
H A Dnfgame.h37 nfgame(int numPlayers, int *actions, const cvector &payoffs);
43 return payoffs[findIndex(player, s)]; in getPurePayoff()
47 payoffs[findIndex(player, s)]= value; in setPurePayoff()
62 cvector payoffs; variable
74 s << g.payoffs;
H A Dgnmgame.h118 cvector payoffs(actions[player]); in getRegret()
119 getPayoffVector(payoffs, player, s); in getRegret()
121 p+=payoffs[i] * s[firstAction(player)+i]; in getRegret()
123 return payoffs.max()-p; in getRegret()
136 cvector payoffs(getNumKSymActions(playerClass)); in getKSymRegret()
137 getKSymPayoffVector(payoffs, playerClass, s); in getKSymRegret()
139 p+=payoffs[i] * s[firstKSymAction(playerClass)+i]; in getKSymRegret()
141 return payoffs.max()-p; in getKSymRegret()
/dports/math/gambit/gambit-16.0.1/library/src/gtracer/
H A Dnfgame.cc32 …me(int numPlayers, int *actions, const cvector &payoffs) : gnmgame(numPlayers, actions), payoffs(p… in nfgame() argument
54 …memcpy(m, payoffs.values() + player * blockSize[numPlayers], blockSize[numPlayers]*sizeof(double)); in getMixedPayoff()
66 …std::vector<double> t(payoffs.values()+player*blockSize[numPlayers], payoffs.values()+(player+1)*b… in getPayoffVector()
89 …memcpy(m, payoffs.values() + rown * blockSize[numPlayers], blockSize[numPlayers] * sizeof(double)); in payoffMatrix()
/dports/finance/quantlib/QuantLib-1.20/ql/cashflows/
H A Ddigitaliborcoupon.cpp150 const std::vector<Rate>& payoffs) { in withCallPayoffs() argument
151 callPayoffs_ = payoffs; in withCallPayoffs()
182 const std::vector<Rate>& payoffs) { in withPutPayoffs() argument
183 putPayoffs_ = payoffs; in withPutPayoffs()
H A Ddigitalcmscoupon.cpp150 const std::vector<Rate>& payoffs) { in withCallPayoffs() argument
151 callPayoffs_ = payoffs; in withCallPayoffs()
182 const std::vector<Rate>& payoffs) { in withPutPayoffs() argument
183 putPayoffs_ = payoffs; in withPutPayoffs()
H A Ddigitalcmscoupon.hpp80 DigitalCmsLeg& withCallPayoffs(const std::vector<Rate>& payoffs);
86 DigitalCmsLeg& withPutPayoffs(const std::vector<Rate>& payoffs);
H A Ddigitaliborcoupon.hpp80 DigitalIborLeg& withCallPayoffs(const std::vector<Rate>& payoffs);
86 DigitalIborLeg& withPutPayoffs(const std::vector<Rate>& payoffs);
/dports/finance/quantlib/QuantLib-1.20/ql/experimental/coupons/
H A Ddigitalcmsspreadcoupon.cpp148 const std::vector<Rate>& payoffs) { in withCallPayoffs() argument
149 callPayoffs_ = payoffs; in withCallPayoffs()
180 const std::vector<Rate>& payoffs) { in withPutPayoffs() argument
181 putPayoffs_ = payoffs; in withPutPayoffs()
H A Ddigitalcmsspreadcoupon.hpp78 DigitalCmsSpreadLeg& withCallPayoffs(const std::vector<Rate>& payoffs);
84 DigitalCmsSpreadLeg& withPutPayoffs(const std::vector<Rate>& payoffs);
/dports/finance/py-quantecon/quantecon-0.5.2/quantecon/game_theory/game_generators/
H A Dbimatrix_generators.py191 payoffs = np.empty(2)
194 payoffs[:] = 0
198 payoffs[p] += values[k, p] / 2
201 payoffs[winner] += values[k, winner]
202 payoff_arrays[0][i, j], payoff_arrays[1][j, i] = payoffs
/dports/finance/quantlib/QuantLib-1.20/ql/models/marketmodels/products/multistep/
H A Dmultistepoptionlets.cpp33 const std::vector<ext::shared_ptr<Payoff> >& payoffs) in MultiStepOptionlets()
35 paymentTimes_(paymentTimes), payoffs_(payoffs) { in MultiStepOptionlets()
H A Dmultistepcoterminalswaptions.cpp31 const std::vector<ext::shared_ptr<StrikedTypePayoff> >& payoffs) in MultiStepCoterminalSwaptions()
33 paymentTimes_(paymentTimes), payoffs_(payoffs) { in MultiStepCoterminalSwaptions()
/dports/finance/quantlib/QuantLib-1.20/ql/models/marketmodels/products/onestep/
H A Donestepoptionlets.cpp33 const std::vector<ext::shared_ptr<Payoff> >& payoffs) in OneStepOptionlets()
35 paymentTimes_(paymentTimes), payoffs_(payoffs) { in OneStepOptionlets()
/dports/math/gambit/gambit-16.0.1/library/src/agg/
H A Dagg.cc56 payoffs(_payoffs), in AGG()
641 aggpayoff::iterator p= payoffs[Node].find(pureprofile); in getPurePayoff()
642 if ( p == payoffs[Node].end() ){ in getPurePayoff()
674 return Pr[numPlayers-1].inner_prod(payoffs[actionSets[player][act]]); in getV()
774 V+= prob * payoffs[node].find(c)->second ; in getSymMixedPayoff()
936 return d.inner_prod(payoffs[uniqueActionSets[playerClass][act]]); in getKSymMixedPayoff()
961 return d.inner_prod(payoffs[uniqueActionSets[pClass1][act1]]); in getKSymMixedPayoff()
1072 result=payoffs[0].begin()->second; in getMaxPayoff()
1074 for (aggpayoff::iterator it=payoffs[i].begin();it!=payoffs[i].end();++it) in getMaxPayoff()
1085 result=payoffs[0].begin()->second; in getMinPayoff()
[all …]
/dports/finance/quantlib/QuantLib-1.20/ql/models/marketmodels/callability/
H A Dbermudanswaptionexercisevalue.cpp30 const std::vector<ext::shared_ptr<Payoff> >&payoffs) in BermudanSwaptionExerciseValue()
33 payoffs_(payoffs), currentIndex_(0) { in BermudanSwaptionExerciseValue()
/dports/math/gambit/gambit-16.0.1/library/include/gambit/agg/
H A Dagg.h102 std::vector<aggpayoff>& payoffs);
165 s << payoffs.at(node).size()<<std::endl; in printPayoffs()
166 s << payoffs[node]; in printPayoffs()
203 const aggpayoff& getPayoffMap(int node){return payoffs.at(node);} in getPayoffMap()
233 std::vector<aggpayoff> payoffs; variable
/dports/math/gambit/gambit-16.0.1/library/src/ipa/
H A Dipa.cc63 cvector payoffs(veclength); in Solve() local
65 A = new nfgame(p_game->NumPlayers(), actions, payoffs); in Solve()
/dports/math/gambit/gambit-16.0.1/library/src/gnm/
H A Dgnm.cc92 cvector payoffs(veclength); in BuildRepresentation() local
94 shared_ptr<gnmgame> A = new nfgame(p_game->NumPlayers(), actions, payoffs); in BuildRepresentation()
/dports/math/gambit/gambit-16.0.1/contrib/games/
H A Dzero.nfg1 NFG 1 D "Two person 2 x 2 game with all zero payoffs" { "1" "2" } { 2 2 }
/dports/finance/py-quantecon/quantecon-0.5.2/quantecon/game_theory/tests/
H A Dtest_normal_form_game.py350 self.payoffs = [0, 1, -1]
351 self.player = Player(self.payoffs)
369 assert_array_equal(self.player.payoff_vector(None), self.payoffs)
453 self.payoffs = [[0, 1]]
454 self.player = Player(self.payoffs)
/dports/finance/quantlib/QuantLib-1.20/ql/instruments/
H A DMakefile.am51 payoffs.hpp \
108 payoffs.cpp \
/dports/math/gambit/gambit-16.0.1/contrib/scripts/enumpoly/
H A Denumpoly.py33 payoffs = [ [] for strategy in support.Strategies(player) ]
48 payoffs[st].append("(%s*%s)" %
52 equations = [ "(%s)-(%s);\n" % ("+".join(payoffs[0]), "+".join(s2))
53 for s2 in payoffs[1:] ]
H A DREADME67 parameter adjusts the tolerance for strategies with superior payoffs
70 payoffs outside the support, so long as the regret is no more than
73 games whose payoffs are on [0, 10] or so).
/dports/finance/quantlib/QuantLib-1.20/test-suite/
H A Dswapforwardmappings.cpp175 std::vector<ext::shared_ptr<StrikedTypePayoff> > payoffs(paymentTimes.size()); in makeMultiStepCoterminalSwaptions() local
176 for (Size i = 0; i < payoffs.size(); ++i){ in makeMultiStepCoterminalSwaptions()
177 payoffs[i] = ext::shared_ptr<StrikedTypePayoff>(new in makeMultiStepCoterminalSwaptions()
181 paymentTimes, payoffs); in makeMultiStepCoterminalSwaptions()
H A Dvariancegamma.cpp159 std::vector<ext::shared_ptr<StrikedTypePayoff> > payoffs; in testVarianceGamma() local
167 payoffs.push_back(payoff); in testVarianceGamma()

1234