The study compares uniform-price and discriminatory auctions in terms of learning difficulty.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
5 results for “uniform-price”
problem Comparing the learning difficulty of uniform-price and discriminatory multi-unit auctions.
method Characterization of learning difficulty through regret minimization in both full-information and bandit feedback settings.
result Regret scales similarly for both auction formats under full-information, but uniform-price auctions can achieve faster learning rates.
Walraswap solves batch auction pricing by finding optimal AMM swaps.
problem Executing all trade orders with optimal automated market makers (AMMs).
method Uses Brouwer's fixed-point theorem to find equilibrium prices.
result A solution to batch auction pricing problems in blockchain.
A framework for cost of belief revision in uncertain agents.
problem Cost of revising beliefs in uncertain agents.
method Axiomatic framework for transport-based belief costs, postulates P0 and P1.
result Cost metric is conformally reweighted by Fisher information, leading to a cost floor diverging at certainty.
We introduce a class of utility-based market makers that always accept orders at their risk-neutral prices. We derive necessary and sufficient conditions for such market makers to have bounded loss. We prove that hyperbolic absolute risk aversion utility market makers are equivalent to weighted pseudospherical scoring …
We formalize and verify double auctions for multiple-quantity trades.
problem Matching multiple-quantity trade requests in double auctions.
method Formalized algorithms, correctness proofs, Coq proof assistant, verified OCaml and Haskell programs.
result Automatic detection of violations in exchange systems.