Risk-Free Bidding in Complement-Free Combinatorial Auctions

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-030-30473-7_9 ◽

2019 ◽

pp. 123-136

Author(s):

Vishnu V. Narayan ◽

Gautam Rayaprolu ◽

Adrian Vetta

Keyword(s):

Combinatorial Auctions

Download Full-text

An overview of combinatorial auctions

ACM SIGecom Exchanges ◽

10.1145/1345037.1345039 ◽

2007 ◽

Vol 7 (1) ◽

pp. 3-14 ◽

Cited By ~ 19

Author(s):

Peter Cramton ◽

Yoav Shoham ◽

Richard Steinberg

Keyword(s):

Combinatorial Auctions

Download Full-text

Separating the communication complexity of truthful and non-truthful combinatorial auctions

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384267 ◽

2020 ◽

Author(s):

Sepehr Assadi ◽

Hrishikesh Khandeparkar ◽

Raghuvansh R. Saxena ◽

S. Matthew Weinberg

Keyword(s):

Communication Complexity ◽

Combinatorial Auctions

Download Full-text

A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions

Electronic Notes in Discrete Mathematics ◽

10.1016/j.endm.2010.05.068 ◽

2010 ◽

Vol 36 ◽

pp. 535-542 ◽

Cited By ~ 3

Author(s):

Dalila Boughaci

Keyword(s):

Differential Evolution ◽

Differential Evolution Algorithm ◽

Combinatorial Auctions ◽

Winner Determination Problem ◽

Winner Determination ◽

Evolution Algorithm

Download Full-text

An O(log log m) prophet inequality for subadditive combinatorial auctions

ACM SIGecom Exchanges ◽

10.1145/3440968.3440972 ◽

2020 ◽

Vol 18 (2) ◽

pp. 32-37

Author(s):

Paul Dütting ◽

Thomas Kesselheim ◽

Brendan Lucier

Keyword(s):

Combinatorial Auctions

Download Full-text

Incentive compatible multi unit combinatorial auctions

Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge - TARK '03 ◽

10.1145/846241.846250 ◽

2003 ◽

Cited By ~ 68

Author(s):

Yair Bartal ◽

Rica Gonen ◽

Noam Nisan

Keyword(s):

Combinatorial Auctions ◽

Incentive Compatible

Download Full-text

The Cost of Simple Bidding in Combinatorial Auctions

Proceedings of the 22nd ACM Conference on Economics and Computation ◽

10.1145/3465456.3467609 ◽

2021 ◽

Author(s):

Vitor Bosshard ◽

Sven Seuken

Keyword(s):

Combinatorial Auctions ◽

The Cost

Download Full-text

A Graph-Based Model for Combinatorial Auctions

2020 IEEE 16th International Conference on Intelligent Computer Communication and Processing (ICCP) ◽

10.1109/iccp51029.2020.9266274 ◽

2020 ◽

Author(s):

Paul Diac

Keyword(s):

Combinatorial Auctions ◽

Graph Based Model

Download Full-text

Offline Algorithms in Low-Frequency Trading

Queue ◽

10.1145/3442632.3448307 ◽

2020 ◽

Vol 18 (6) ◽

pp. 37-51

Author(s):

Terence Kelly

Keyword(s):

Real Time ◽

Real World ◽

High Frequency ◽

Low Frequency ◽

Combinatorial Auctions ◽

Hard Problem ◽

Np Hard ◽

High Stakes ◽

Drill Bits ◽

Np Hard Problem

Expectations run high for software that makes real-world decisions, particularly when money hangs in the balance. This third episode of the Drill Bits column shows how well-designed software can effectively create wealth by optimizing gains from trade in combinatorial auctions. We'll unveil a deep connection between auctions and a classic textbook problem, we'll see that clearing an auction resembles a high-stakes mutant Tetris, we'll learn to stop worrying and love an NP-hard problem that's far from intractable in practice, and we'll contrast the deliberative business of combinatorial auctions with the near-real-time hustle of high-frequency trading. The example software that accompanies this installment of Drill Bits implements two algorithms that clear combinatorial auctions.

Download Full-text