Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
On the computational power of iterative auctions
Proceedings of the 6th ACM conference on Electronic commerce
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Game Theory
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Item pricing for revenue maximization
Proceedings of the 9th ACM conference on Electronic commerce
A Characterization of 2-Player Mechanisms for Scheduling
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Truthful Approximation Schemes for Single-Parameter Agents
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On the importance of migration for fairness in online grid markets
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
How to sell a graph: guidelines for graph retailers
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A lower bound of 1 + ϕ for truthful scheduling mechanisms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Proceedings of the 12th ACM conference on Electronic commerce
Lower bound for envy-free and truthful makespan approximation on related machines
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
A global characterization of envy-free truthful scheduling of two tasks
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Generalizing envy-freeness toward group of agents
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Envy-Free Makespan Approximation
SIAM Journal on Computing
Mechanisms and impossibilities for truthful, envy-free allocations
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Prior-independent mechanisms for scheduling
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Combinatorial walrasian equilibrium
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We study the problem of fairness design . Specifically, we focus on approximation algorithms for indivisible items with supporting envy-free bundle prices. We present the first polynomial-communication envy-free profit-maximizing combinatorial auctions for general bidders. In this context, envy-free prices can be interpreted as anonymous non-discriminatory prices. Additionally, we study the canonical makespan-minimizing scheduling problem of unrelated machines, in an envy-free manner. For the special case of related machines model we show that tight algorithmic bounds can be achieved.