Computationally Manageable Combinational Auctions
Reads0
Chats0
TLDR
In this paper, the problem of determining the revenue maximizing set of nonconflicting bids can be solved for combinational auctions where the value of assets to a bidder depends on which other assets he or she wins.Abstract:
There is interest in designing simultaneous auctions for situations such as the recent FCC radio spectrum auctions, in which the value of assets to a bidder depends on which other assets he or she wins. In such auctions, bidders may wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue maximizing set of nonconflicting bids can be difficult. We analyze this problem, identifying several different structures of permitted combinational bids for which computational tractability is constructively demonstrated and some structures for which computational tractability cannot be guaranteed.read more
Citations
More filters
Book
Algorithmic Game Theory
TL;DR: A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior in a bid to solve the challenges of 21st Century finance.
Journal ArticleDOI
Algorithmic Mechanism Design
Noam Nisan,Noam Nisan,Amir Ronen +2 more
TL;DR: This work considers algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest, and suggests a framework for studying such algorithms.
Book
Putting Auction Theory to Work
TL;DR: This book provides a comprehensive introduction to modern auction theory and its important new applications and explores the tension between the traditional theory of auctions with a fixed set of bidders and the theory of Auction with endogenous entry, in which bidder profits must be respected to encourage participation.
Book
Combinatorial Auctions
TL;DR: It's important for you to start having that hobby that will lead you to join in better concept of life and reading will be a positive activity to do every time.
Journal ArticleDOI
Combinatorial Auctions: A Survey
Sven de Vries,Rakesh Vohra +1 more
TL;DR: The state of knowledge about the design of combinatorial auctions is surveyed and some new insights are presented.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Reducibility Among Combinatorial Problems.
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.