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