Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
Jugal Garg
, Aniket Murhekar
Industrial and Enterprise Systems Engineering
Siebel School of Computing and Data Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Pareto Optimal
100%
Allocation of Indivisible Goods
100%
Envy-free Allocations
100%
Optimal Allocation
71%
Pareto Optimality
71%
Pseudo-polynomial Time
28%
Strongly Polynomial Time
28%
Popular
14%
Time Algorithm
14%
Polynomial Time
14%
Polynomial-time Algorithm
14%
Complexity Classes
14%
Efficient Allocation
14%
Fair Allocation
14%
Pseudo-polynomial Time Algorithm
14%
Nash Social Welfare
14%
Additive Valuations
14%
Envy-freeness
14%
Fairness Notion
14%
Indivisible Goods
14%
Polynomial-time Computability
14%
Non-constructive Proof
14%
Computer Science
Polynomial Time
100%
Optimal Allocation
100%
Pareto-optimality
100%
Pareto Optimality
100%
polynomial-time algorithm
40%
Complexity Class
20%
Constructive Proof
20%
Computability
20%
Mathematics
Polynomial Time
100%
Pareto Optimal
100%
Optimality
71%
Constructive Proof
14%