English
Related papers

Related papers: Parimutuel Betting on Permutations

200 papers

Combinatorial Auctions are a central problem in Algorithmic Mechanism Design: pricing and allocating goods to buyers with complex preferences in order to maximize some desired objective (e.g., social welfare, revenue, or profit). The…

Computer Science and Game Theory · Computer Science 2015-03-19 Avrim Blum , Anupam Gupta , Yishay Mansour , Ankit Sharma

I construct a novel random double auction as a robust bilateral trading mechanism for a profit-maximizing intermediary who facilitates trade between a buyer and a seller. It works as follows. The intermediary publicly commits to charging a…

Theoretical Economics · Economics 2022-05-11 Wanchang Zhang

We introduce a price impact model which accounts for finite market depth, tightness and resilience. Its coupled bid- and ask-price dynamics induce convex liquidity costs. We provide existence of an optimal solution to the classical problem…

Mathematical Finance · Quantitative Finance 2018-04-23 Peter Bank , Moritz Voß

The author seeks to develop a model to alter the bid-offer spread, currently quoted by market makers, that varies with the market and trading conditions. The dynamic nature of financial markets and trading, as with the rest of social…

Economics · Quantitative Finance 2016-02-03 Ravi Kashyap

We investigate revenue guarantees for auction mechanisms in a model where a distribution is specified for each bidder, but only some of the distributions are correct. The subset of bidders whose distribution is correctly specified…

Computer Science and Game Theory · Computer Science 2020-07-22 Makis Arsenis , Odysseas Drosis , Robert Kleinberg

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

Theoretical Economics · Economics 2020-08-27 Alex Suzdaltsev

We introduce a criterion how to price derivatives in incomplete markets, based on the theory of growth optimal strategy in repeated multiplicative games. We present reasons why these growth-optimal strategies should be particularly relevant…

Statistical Mechanics · Physics 2009-10-31 Erik Aurell , Roberto Baviera , Ola Hammarlid , Maurizio Serva , Angelo Vulpiani

We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition.…

Quantum Physics · Physics 2007-11-26 Tad Hogg , Pavithra Harsha , Kay-Yut Chen

All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the auction. We model such failures, and fully characterize…

Computer Science and Game Theory · Computer Science 2017-02-15 Yoad Lewenberg , Omer Lev , Yoram Bachrach , Jeffrey S. Rosenschein

This paper focus on pricing exchange option based on copulas by MCMC algorithm. Initially, we introduce the methodologies concerned about risk-netural pricing, copulas and MCMC algorithm. After the basic knowledge, we compare the option…

Mathematical Finance · Quantitative Finance 2021-07-22 Wen Su

Classical Bayesian mechanism design relies on the common prior assumption, but such prior is often not available in practice. We study the design of prior-independent mechanisms that relax this assumption: the seller is selling an…

Theoretical Economics · Economics 2024-12-12 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes

We consider the fundamental scenario where a single item is to be sold to one of two agents. Both agents draw their valuation for the item from the same probability distribution. However, only one of them submits a bid to the mechanism. The…

Computer Science and Game Theory · Computer Science 2025-08-26 Ioannis Caragiannis , Georgios Kalantzis

We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive fragment of the $\mu$-calculus. To this end we devise a method…

Logic in Computer Science · Computer Science 2018-03-16 Daniel Hausmann , Lutz Schröder , Hans-Peter Deifel

In the matroid buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it arrives, subject to a matroid constraint on the set of accepted bids. Decisions to reject bids are…

Computer Science and Game Theory · Computer Science 2009-11-30 Ashwinkumar B. V. , Robert Kleinberg

We consider the problem of a revenue-maximizing seller with m items for sale to n additive bidders with hard budget constraints, assuming that the seller has some prior distribution over bidder values and budgets. The prior may be…

Computer Science and Game Theory · Computer Science 2016-05-09 Constantinos Daskalakis , Nikhil R. Devanur , S. Matthew Weinberg

The paper develops general, discrete, non-probabilistic market models and minmax price bounds leading to price intervals for European options. The approach provides the trajectory based analogue of martingale-like properties as well as a…

Mathematical Finance · Quantitative Finance 2015-11-06 Sebastian E. Ferrando , Alfredo L. Gonzalez , Ivan L. Degano , Massoome Rahsepar

A public decision-making problem consists of a set of issues, each with multiple possible alternatives, and a set of competing agents, each with a preferred alternative for each issue. We study adaptations of market economies to this…

Computer Science and Game Theory · Computer Science 2019-07-23 Nikhil Garg , Ashish Goel , Benjamin Plaut

The Artificial Prediction Market is a recent machine learning technique for multi-class classification, inspired from the financial markets. It involves a number of trained market participants that bet on the possible outcomes and are…

Machine Learning · Statistics 2014-08-18 Nathan Lay , Adrian Barbu

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…

Computer Science and Game Theory · Computer Science 2025-10-07 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

Recent studies have revealed a number of striking dependence patterns in high frequency stock price dynamics characterizing probabilistic interrelation between two consequent price increments x (push) and y (response) as described by the…

Physics and Society · Physics 2009-11-13 Andrei Leonidov , Vladimir Trainin , Alexander Zatsev , Sergey Zaitsev