Computer Science
Approximation (Algorithm)
50%
Approximation Algorithms
25%
Approximation Ratio
8%
Bipartite Graph
16%
Budget Constraint
50%
Capacity Constraint
33%
Constraint Problem
16%
Convex Programming
8%
Directed Graphs
25%
Dynamic Resource Allocation
33%
Electronic Learning
50%
Energy Efficiency
50%
Formalization
25%
Job Scheduling
16%
Learning Framework
16%
Learning Problem
16%
Markov Decision Process
50%
multi agent
25%
Network Design
50%
Network Design Problem
16%
Normal Form Game
25%
Online Learning Technique
16%
Parallel Machine
8%
Pareto Optimality
50%
Pareto-optimality
50%
Polynomial Time
8%
State Transition
16%
steiner tree
8%
Subadditive
8%
Weighted Voting Game
50%
Economics, Econometrics and Finance
Auction
62%
Bitcoin
50%
Monopoly
50%
Normal-Form Game
12%
Option Value
50%
Pareto Efficiency
50%
Payment Scheme
10%
Payment System
12%
Principal-Agent
50%
Public Budget
50%
Social Welfare
50%
Voting Game
50%
Welfare
100%
Willingness to Pay
12%
Mathematics
Bipartite Graph
16%
Convex Programming
7%
Cost Function
50%
Edge
14%
Formalization
25%
Incomplete Information
50%
Initial State
16%
Main Result
16%
Markov Decision Process
50%
Polynomial Time
40%
Sharp Contrast
25%
State Transition
16%
Subadditive
7%
Wide Variety
25%
Worst Case
50%
