第 11 / 23 页
非代码面试题
显示 20 / 453 道匹配题目
答题状态：未尝试未正确已正确
ID题目领域难度题型进度权限
2683Why Long Training Windows Can Learn the Wrong WorldWhy can adding more historical years lower estimation variance and yet make a finance model worse?机器学习中等essay未尝试面试订阅2685Why Crisis Prediction Suffers From Tiny Relevant Sample SizeWhy does a century of daily data still leave very little effective evidence for training a model about true crisis behavior?机器学习困难essay未尝试面试订阅2686Why Correlation Spikes Break Signal Combining RulesWhy can a portfolio of seemingly diversified alpha signals stop diversifying exactly when markets become stressed?机器学习简单essay未尝试免费2689Why Adaptive Opponents Break Stationary Learning AssumptionsWhy is finance especially hostile to the idea that the data-generating process will sit still while your model learns it?机器学习困难essay未尝试面试订阅2693Why Average Error Metrics Can Hide State-Dependent FailureWhy can a model with acceptable average forecast error still be dangerous in finance?机器学习中等essay未尝试面试订阅2694Why Capacity Scaling Can Erase a Modest EdgeWhy can a signal that is clearly profitable at small size become useless when a larger book tries to deploy it?机器学习中等essay未尝试面试订阅2714Why Search Depth Is Bigger Than the Number of Named StrategiesWhy can a team that claims to have tested only five named strategies still have conducted a much deeper search than that number suggests?机器学习困难essay未尝试面试订阅2720Why Live Degradation Should Be the Default ExpectationWhy should a PM expect live performance to come in below the very best backtest rather than treat any shortfall as an implementation surprise?机器学习困难essay未尝试面试订阅2723Execution Schedules With at Most One Large SliceAn execution schedule reaches total size 11 using slices of sizes 1, 2, and 5, but the large 5-lot slice may be used at most once. Order of slices does not matter. How many schedules are possible?脑筋急转弯中等derivation未尝试面试订阅2734Weighted Sum With One Binary Heavy BlockHow many nonnegative integer solutions satisfy 2a+3b+4c+6d=20 if d is restricted to be either 0 or 1?脑筋急转弯困难derivation未尝试面试订阅2737Inventory Paths With Holds InsertedA trader executes 4 buys, 4 sells, and 2 holds. Buys and sells each change inventory by plus or minus 1, holds leave inventory unchanged. The trader starts flat, ends flat, and inventory may never become negative at any intermediate time. How many execution sequences are possible?脑筋急转弯困难derivation未尝试面试订阅2741Bid Ceiling With a Fixed Outside OptionA trader values a data license at v. In a sealed first-price auction against one rival, winning with bid b occurs with probability p(b). If skipping the auction preserves an outside payoff of c, what inequality must b satisfy for participating with bid b to weakly dominate skipping?脑筋急转弯中等derivation未尝试面试订阅2742When a Rebate Makes Aggressive Bidding RationalIn a first-price auction, a bidder of value v receives a fixed rebate r if she loses, and nothing if she skips. If bidding b wins with probability p(b), derive the expected payoff of bidding b and compare it with skipping.脑筋急转弯中等derivation未尝试面试订阅2743Scaled Uniform Values and Win ProbabilityThree bidders have i.i.d. private values from Uniform (20,80). In a first-price auction, find the symmetric equilibrium bid of a bidder with value 56. Also compute that bidder's probability of winning under equilibrium play.脑筋急转弯中等derivation未尝试面试订阅2744First-Price Equilibrium Under a Quadratic CDFTwo bidders have i.i.d. private values on [0,1] with CDF F(v)=v 2. In a first-price auction, derive the symmetric equilibrium bid function and compute the bid for value 0.6.脑筋急转弯中等derivation未尝试面试订阅2745Reverse Auction With Two SuppliersA buyer runs a sealed-bid procurement auction with two risk-neutral suppliers. Each supplier's cost is i.i.d. Uniform (0,1), and the lowest bid wins and is paid its own bid. Derive the symmetric equilibrium bid function s(c), and compute the expected profit of a supplier with cost 0.2.脑筋急转弯中等derivation未尝试面试订阅2746Truthful Bidding Under a Capacity PenaltyIn a second-price auction for one extra inventory slot, paying above your true value v can backfire because if you win while your realized usage is low, you incur a deterministic penalty k. If the penalty is independent of the auction price and only applies when you win, what is the effective value that should replace v in the usual Vickrey truth-telling argument?脑筋急转弯困难derivation未尝试面试订阅2747All-Pay Contest Break-Even EffortTwo equally skilled quants enter an all-pay contest for a prize worth V. A contestant who spends effort e while the rival spends e 0 wins with probability e/(e+e 0), and everyone pays their own effort regardless of outcome. Holding e 0 fixed, write the payoff of effort e and solve the equation that defines break-even effort.脑筋急转弯简单derivation未尝试面试订阅2748Why Third-Price Auctions Are Not TruthfulShow by explicit counterexample that truthful bidding is not a dominant strategy in a third-price auction with three bidders, where the highest bidder wins but pays the third-highest bid.脑筋急转弯简单derivation未尝试面试订阅2749English Auction Dropout LogicFour bidders have independent private values 40, 55, 70, and 90. In an English ascending auction with no reserve, who wins, what price is paid, and why is the outcome equivalent to a second-price auction in this private-value setting?脑筋急转弯简单derivation未尝试面试订阅