Mathematics
Combinatorial Auctions
74%
Approximation Algorithms
60%
Mechanism Design
55%
Game
45%
Pricing
38%
Auctions
37%
Approximation
27%
Approximability
25%
Budget Constraint
24%
Traffic
23%
Achromatic number
22%
Network Design
20%
Customers
19%
Welfare
19%
Polynomial time
17%
Pollution
17%
Experimental Study
17%
Multi-objective Optimization
17%
Multiobjective Optimization Problems
17%
Strategy
16%
Demand
16%
Server
16%
Hardness
15%
Incentives
15%
Price of Anarchy
14%
Best Approximation
14%
Randomized Rounding
14%
Scheduling
14%
Graph in graph theory
14%
NP-complete problem
14%
Design
14%
Monotone
13%
Connectivity
13%
Model
13%
Minimum Spanning Tree
13%
Congestion Games
12%
Lagrangian Relaxation
12%
Online Auctions
12%
Polynomial-time Algorithm
12%
Optimization Problem
12%
Competitiveness
12%
Efficient Algorithms
12%
Vertex of a graph
11%
Inapproximability
11%
Prophet Inequality
11%
Facility Location Problem
11%
Independent Set
11%
Algorithmic Mechanism Design
11%
Costs
11%
Externalities
11%
Engineering & Materials Science
Approximation algorithms
100%
Polynomials
59%
NP-hard
32%
Costs
26%
Hardness
25%
Pollution
19%
Linear programming
17%
Scheduling
16%
Multiobjective optimization
13%
Pollution control
12%
Servers
10%
Ladders
10%
Color
10%
Purchasing
8%
Pattern matching
7%
Ontology
7%
Farms
7%
Resource allocation
6%
Relaxation
6%
Set theory
6%
Cost functions
6%
Economics
6%
Agglomeration
6%