Proceedings of the 13th ACM Conference on Electronic Commerce 2012
DOI: 10.1145/2229012.2229047
|View full text |Cite
|
Sign up to set email alerts
|

A tractable combinatorial market maker using constraint generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 12 publications
(26 citation statements)
references
References 13 publications
0
26
0
Order By: Relevance
“…Researchers are eager to learn about the relationships between states in the same way that they are interested in to know the relationships between economic indicators or product launches. The underlying problem is NP-hard, and while new approximation techniques (Dudik et al, 2012;Lahaie et al, 2013) are possible, they may be too new for commercial adoption. On the other hand, for smaller outcomes spaces on the order of hundreds or thousands, we do not see serious technical barriers to adopting linear programming in the exchange.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Researchers are eager to learn about the relationships between states in the same way that they are interested in to know the relationships between economic indicators or product launches. The underlying problem is NP-hard, and while new approximation techniques (Dudik et al, 2012;Lahaie et al, 2013) are possible, they may be too new for commercial adoption. On the other hand, for smaller outcomes spaces on the order of hundreds or thousands, we do not see serious technical barriers to adopting linear programming in the exchange.…”
Section: Discussionmentioning
confidence: 99%
“…In this case, limiting the expressiveness of bids (i.e., restricting what bundles are allowed) can recover tractable algorithms, though often the limits are severe and impractical (Agrawal et al, 2008;Chen et al, 2007;Chen et al, 2008a;Chen et al, 2008b;Guo and Pennock, 2009;Pennock and Xia, 2011). Alternatively, approximation schemes are possible, both stochastic (Chen et al, 2008b) and deterministic (Dudik et al, 2012;Lahaie et al, 2013).…”
Section: Designing Better Prediction Marketsmentioning
confidence: 99%
See 1 more Smart Citation
“…Li et al (2013) extended this framework to a parameterized class of markets with adaptive liquidity, and studied the relationship of market parameters to the market's ability to aggregate information and make a profit. Dudík et al (2012) proposed a market maker that achieves some information sharing among related securities, without restricting the securities that can be traded. Convex optimization and constraint generation are used to detect and eliminate some kinds of arbitrage opportunities.…”
Section: Combinatorial Prediction Marketsmentioning
confidence: 99%
“…For instance, the NCAA 2010 market included securities on events "Duke wins more games than Cornell" and "a team from the Big East conference wins the championship" as well as many others. Because of the large number of securities in combinatorial markets, there may be no sellers interested in trading with a given buyer, IP constraints of FWMM can be used directly in LCMM, as linear-programming relaxations, but they are usually too loose, so tighter constraints need to be derived ad hoc for each new security type, sometimes using involved combinatorial reasoning [Dudík et al 2012[Dudík et al , 2013. Since LCMM updates are usually substantially faster than solving an IP, the arbitrage-removal steps of LCMM and FWMM can be interleaved, and the more expensive projection step of FWMM should be invoked only after LCMM cannot remove much arbitrage.…”
Section: Introductionmentioning
confidence: 99%