Keyphrases
Combinatorial Auctions
97%
Bidders
95%
Incentive Mechanism
52%
Approximation Ratio
46%
Truthful Mechanism
44%
Multi-unit Auctions
35%
Polynomial Time
29%
Subadditive
28%
Communication Complexity
25%
Social Welfare
22%
Algorithmic Mechanism Design
21%
Randomized Mechanism
20%
VCG Payments
20%
Cost Sharing
18%
Computationally Efficient
18%
Approximation Algorithms
16%
Approximation Mechanism
15%
Oracle
15%
Value Queries
13%
Dominant Strategy
13%
Welfare Maximization
12%
Approximation Scheme
12%
Buyers
12%
Impossibility Results
12%
Oracle Model
11%
Scheduling Mechanism
11%
Social Choice Function
11%
Mechanism Design
11%
Budget Constraint
11%
Optimal Lower Bound
10%
Constant-factor Approximation Algorithm
10%
Monotone
10%
Submodular Function
10%
Computational Complexity
9%
2-approximation
9%
Valuation Function
9%
Payment System
9%
Cost Function
9%
Economic Efficiency
9%
Constant Approximation
9%
Bilateral Trade
9%
Tight
8%
Subadditive Valuations
8%
Seller
8%
Cost-sharing Mechanism
7%
Multi-parameter
7%
Time Incentive
7%
Related Machines
6%
Combinatorial Scheduling
6%
Unrelated Machines
6%
Computer Science
Combinatorial Auction
100%
Approximation (Algorithm)
80%
Subadditive
51%
Approximation Ratio
45%
Polynomial Time
43%
Mechanism Design
31%
Approximation Algorithms
28%
Communication Complexity
24%
Dominant Strategy
18%
approximation factor
16%
Constant Factor
15%
approximation scheme
12%
Scheduling Mechanism
11%
Computational Complexity
11%
Single Parameter
10%
Potential Mechanism
9%
Payment Scheme
9%
Economic Efficiency
9%
Subclasses
8%
polynomial-time algorithm
7%
Time Approximation Scheme
7%
Cardinality
7%
Fully Polynomial-Time Approximation Scheme
5%
Communication Cost
5%
Good Approximation
5%
Computational Efficiency
5%
Nash Equilibrium
5%
Fast Algorithm
5%