Robustness of the k-double auction under Knightian uncertainty

Double Auctions;Regret Minimization;Knightian Uncertainty;Decision Theory;Mechanism Design

Shafer, Rachel C

关键词: Double Auctions;    Regret Minimization;    Knightian Uncertainty;    Decision Theory;    Mechanism Design;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/90542/SHAFER-DISSERTATION-2016.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

This dissertation considers the robustness of private value and common value k-double auctions when those markets are populated by regret minimizers. Regret minimizing agents, unlike typical expected utility maximizers, need not commit to a single prior in their decision rule. In fact, it is a feature of the minimax regret decision rule that is not based on any prior. This makes the decision rule an interesting one for agents who face Knightian Uncertainty. A decision problem involves Knightian uncertainty if the agents know the possible outcomes but not those outcomes' probabilities -- as may be the case in a new market. This dissertation shows that in a private value k-double auction, minimax regret traders will not converge to price-taking behavior as the market grows. Similarly, in a common value auction, traders' behavior may depend on the parameter k, but does not depend on the number of other traders in the market. The invariance of regret minimizing traders' strategies to the size of the markets they inhabit is not an accident of the sealed bid double auction institution. In fact, it is a consequence of the symmetry axiom. The final chapter in this dissertation shows that any agents in a k-double auction who use decision rules that accord with the symmetry axiom, then their bids and asks will not depend on the number of rival traders.