2015.The Hedonic Threshold Methodology (HTM), through the determination of compromised acceptance threshold (CAT) and hedonic rejection threshold (HRT), has several applications by the food industry. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, pages 1050-1056. In Proceedings of the 15th ACM Conference on Economics and Computation, pages 675-692. Fair enough: Guaranteeing approximate maximin shares. In Proceedings of the 24th International Joint Conference on Artificial Intelligence, pages 617-623. Simple causes of complexity in hedonic games. In Proceedings of the 30th AAAI Conference on Artificial Intelligence. Graphical hedonic games of bounded treewidth. Complexity of hedonic games with dichotomous preferences. Annals of Mathematics and Artificial Intelligence, 68(1-3):65-90, 2013. A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, chapter 8, pages 493-550. Rothe, editor, Economics and Computation. In Proceedings of the 14thInternational Joint Conference on Autonomous Agents and Multiagent Systems, pages 1229-1238. ![]() Representing and solving hedonic games with ordinal preferences and thresholds. When can the maximin share guarantee be guaranteed? In Proceedings of the 30th AAAI Conference on Artificial Intelligence. Hedonic coalition formation games: A new stability notion. Springer-Verlag Lecture Notes in Artificial Intelligence #9346, Sept. In Proceedings of the 4th International Conference on Algorithmic Decision Theory, pages 521-536. Fairness and rank-weighted utilitarianism in resource allocation. Computers and Intractability: A Guide to the Theory of NP-Completeness. In Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems, pages 417-424. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, chapter 3, pages 135-193. Price of Pareto optimality in hedonic games. Hedonic coalitions: Optimality and stability. Simple priorities and core stability in hedonic games. Issues in multiagent resource allocation. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. In Proceedings of the 21st International Joint Conference on Artificial Intelligence, pages 79-84. Coalitional affinity games and the stability gap. A preliminary version appeared in the proceedings of AAMAS-2014. Journal of Autonomous Agents and Multi-Agent Systems. Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Procaccia, editors, Handbook of Computational Social Choice, chapter 12. The stability of hedonic coalition structures. In Proceedings of the 14th International Joint Conference on Autonomous Agents and Multiagent Systems, pages 1239-1247. On the price of stability of fractional hedonic games. Springer-Verlag Lecture Notes in Computer Science #8877, Dec. ![]() In Proceedings of the 10th International Workshop on Internet & Network Economics, pages 486-491. Nash stability in fractional hedonic games. Core in a simple coalition formation game. Procaccia, editors, Handbook of Computational Social Choice, chapter 15. In Proceedings of the 24th International Joint Conference on Artificial Intelligence, pages 461-467. Welfare maximization in fractional hedonic games. Computing desirable partitions in additively separable hedonic games. InProceedings of the 13th International JointConference on Autonomous Agents and Multiagen Systems,pages 5-12. In Proceedings of the 11th International Joint Conference on Autonomous Agents and Multiagent Systems, pages 763-770. Existence of stability in hedonic coalition formation games. Springer-Verlag Lecture Notes in Computer Science #9134, July 2015. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, pages 39-51. Approximation algorithms for computing maximin share allocations.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |