MAX-CUT has a randomized approximation scheme in dense graphs
Random Structures & Algorithms
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Hardness of Approximating Max k-Cut and Its Dual
On the Hardness of Approximating Max k-Cut and Its Dual
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Mixed strategies in combinatorial agency
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Hi-index | 0.00 |
We study a "principal-agent" setting in which a principal motivates a team of agents to participate in her project (e.g., friends in a social event or store owners in a shopping mall). A key element in our model is the externalities among the agents; i.e., the benefits that the agents gain from each others' participation. Bernstein and Winter [6] devised a basic model for this setting and characterized the optimal incentive mechanism inducing full participation as a unique Nash equilibrium. Here we suggest and embark on several generalizations and extensions to the basic model, which are grounded in real-life scenarios. First, we study the effect of side payments among the agents on the structure of the optimal mechanism and the principal's utility. Second, we study the optimal partition problem in settings where the principal operates multiple parallel projects.