Keyphrases
Price of Anarchy
62%
Strong Equilibrium
49%
Social Welfare
48%
Buyers
42%
Tight
39%
Nash Equilibrium
34%
Prophet Inequality
32%
Optimal Contract
27%
Bidders
27%
Competitive Ratio
25%
Envy-free
25%
Tight Bounds
24%
Seller
24%
Fair Division
24%
Posted Price
23%
Best Response Dynamics
23%
Pure Nash Equilibrium
23%
Job Scheduling
23%
Combinatorial Auctions
22%
Hidden Action
22%
Legionella Pneumophila
22%
Walrasian Equilibrium
21%
Subadditive Valuations
21%
Congestion Effect
21%
Selling
21%
Additive Valuations
20%
Online Algorithms
19%
Valuation Function
18%
Mechanism Design
18%
Free-riding
18%
Resource Allocation Games
18%
Social Cost
18%
Incentive Mechanism
18%
Capacitated
17%
Strategic Agents
17%
Strong Price of Anarchy
17%
Matroid
17%
Optimal Mechanism
17%
Scheduling Game
16%
Gross Substitutes
16%
Feasibility Constraints
16%
Liquid Welfare
16%
Envy-freeness
16%
Optimal Revenue
15%
Constant Approximation
15%
Price of Stability
15%
Legionella Species
15%
Multi-agent
15%
Subadditive
15%
Agent Behavior
14%
Mathematics
Main Result
81%
Nash Equilibrium
69%
Approximates
58%
Subadditive
50%
Polynomial Time
33%
Competitive Ratio
30%
Upper Bound
30%
Probability Theory
29%
Bayesian
28%
Constant Factor
27%
Objective Function
26%
Edge
24%
Open Problem
21%
Cost Function
19%
Stochastics
19%
Approximability
19%
Budget Constraint
16%
Greedy Algorithm
15%
Lower and upper bounds
15%
Minimizes
15%
Existence Result
14%
Optimal Strategy
12%
Real Line
12%
Incomplete Information
12%
Action Space
12%
Minimax
11%
Mixed Strategy
11%
Set Function
11%
Congestion Game
11%
Optimality
10%
Real Life
10%
Convergence Rate
9%
Time Step
9%
Min-Max
9%
Nonuniform
9%
World Problems
9%
Arrival Time
9%
Departure Time
9%
Arrival Process
9%
Lower Type
9%
Open Question
9%
Pareto Optimal
9%
Linear Function
9%
Discrete Time
9%
Dominant Strategy
9%
Bipartite Graph
7%
Fully Polynomial-Time Approximation Scheme
7%
Worst Case
7%
Sufficient Condition
7%
Simplest Case
7%
Computer Science
Approximation (Algorithm)
100%
Nash Equilibrium
63%
Subadditive
37%
Combinatorial Auction
34%
Competitive Ratio
29%
Job Scheduling
24%
Mechanism Design
20%
Threshold Algorithm
18%
Objective Function
18%
on-line algorithm
17%
bipartite matching
15%
polynomial-time algorithm
15%
Network Topology
14%
Performance Guarantee
14%
Peer-to-Peer System
14%
Sufficient Condition
13%
free-riding
13%
Constant Factor
13%
Success Probability
13%
Approximation Algorithms
12%
Subclasses
12%
Strategic Behavior
12%
Greedy Algorithm
12%
Strategy Profile
11%
Approximation Ratio
11%
Topology Graph
11%
Polynomial Time
11%
multi agent
10%
Processing Time
9%
Network Design
9%
Individual Task
9%
Contention Resolution
9%
Directed Network
9%
Asymptotic Result
9%
Undirected Network
9%
Stochastic Optimization
9%
Medical Doctor
9%
Optimal Strategy
9%
Network Routing
9%
Instantiation
9%
Dominant Strategy
9%
Convergence Rate
9%
Restrict Attention
9%
Conference Paper
9%
Resolution Scheme
9%
Capacity Constraint
9%
Budget Constraint
9%
Real-World Problem
9%
Packing Problem
9%
Resource Allocation
9%
