Faster access than browser!
15 relations: Auction, Cambridge University Press, Combinatorial game theory, Estate sale, First-price sealed-bid auction, Incentive compatibility, Lagrangian relaxation, Landing slot, Mathematical optimization, MIT Press, NP-hardness, Set packing, Smart market, Spectrum auction, Time complexity.
Auction
An auction is a process of buying and selling goods or services by offering them up for bid, taking bids, and then selling the item to the highest bidder.
New!!: Combinatorial auction and Auction · See more »
Cambridge University Press
Cambridge University Press (CUP) is the publishing business of the University of Cambridge.
New!!: Combinatorial auction and Cambridge University Press · See more »
Combinatorial game theory
Combinatorial game theory (CGT) is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information.
New!!: Combinatorial auction and Combinatorial game theory · See more »
Estate sale
An estate sale or estate liquidation is a sale or auction to dispose of a substantial portion of the materials owned by a person who is recently deceased or who must dispose of their personal property to facilitate a move.
New!!: Combinatorial auction and Estate sale · See more »
First-price sealed-bid auction
A first-price sealed-bid auction (FPSBA) is a common type of auction.
New!!: Combinatorial auction and First-price sealed-bid auction · See more »
Incentive compatibility
A mechanism is called incentive-compatible (IC) if every participant can achieve the best outcome to him/herself just by acting according to his/her true preferences.
New!!: Combinatorial auction and Incentive compatibility · See more »
Lagrangian relaxation
In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization by a simpler problem.
New!!: Combinatorial auction and Lagrangian relaxation · See more »
Landing slot
A landing slot, takeoff slot, or airport slot is a right granted by an airport owner which allows the slot holder to schedule a landing or departure during a specific time period.
New!!: Combinatorial auction and Landing slot · See more »
Mathematical optimization
In mathematics, computer science and operations research, mathematical optimization or mathematical programming, alternatively spelled optimisation, is the selection of a best element (with regard to some criterion) from some set of available alternatives.
New!!: Combinatorial auction and Mathematical optimization · See more »
MIT Press
The MIT Press is a university press affiliated with the Massachusetts Institute of Technology (MIT) in Cambridge, Massachusetts (United States).
New!!: Combinatorial auction and MIT Press · See more »
NP-hardness
NP-hardness (''n''on-deterministic ''p''olynomial-time hardness), in computational complexity theory, is the defining property of a class of problems that are, informally, "at least as hard as the hardest problems in NP".
New!!: Combinatorial auction and NP-hardness · See more »
Set packing
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems.
New!!: Combinatorial auction and Set packing · See more »
Smart market
A smart market is a periodic auction which is cleared by the operations research technique of mathematical optimization, such as linear programming.
New!!: Combinatorial auction and Smart market · See more »
Spectrum auction
A spectrum auction is a process whereby a government uses an auction system to sell the rights (licences) to transmit signals over specific bands of the electromagnetic spectrum and to assign scarce spectrum resources.
New!!: Combinatorial auction and Spectrum auction · See more »
Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
New!!: Combinatorial auction and Time complexity · See more »
