Integer and combinatorial optimization
Integer and combinatorial optimization
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
On the complexity of cooperative solution concepts
Mathematics of Operations Research
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
On the computational complexity of qualitative coalitional games
Artificial Intelligence
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Multi-attribute coalitional games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Temporal qualitative coalitional games
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Computer science and game theory
Communications of the ACM - Designing games with a purpose
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Computing the nucleolus of weighted voting games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Constrained coalitional games: formal framework, properties, and complexity results
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
An anytime algorithm for optimal coalition structure generation
Journal of Artificial Intelligence Research
Infeasibility certificates and the complexity of the core in coalitional games
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the computational complexity of coalitional resource games
Artificial Intelligence
On the complexity of compact coalitional games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the computational complexity of weighted voting games
Annals of Mathematics and Artificial Intelligence
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than by acting in isolation. In the classical Transferable Utility (TU) setting, coalition worths can be freely distributed amongst agents. However, in several application scenarios, this is not the case and the Non-Transferable Utility setting (NTU) must be considered, where additional application-oriented constraints are imposed on the possible worth distributions. In this paper, an approach to define NTU games is proposed which is based on describing allowed distributions via a set of mixed-integer linear constraints applied to an underlying TU game. It is shown that such games allow non-transferable conditions on worth distributions to be specified in a natural and succinct way. The properties and the relationships among the most prominent solution concepts for NTU games that hold when they are applied on (mixed-integer) constrained games are investigated. Finally, a thorough analysis is carried out to assess the impact of issuing constraints on the computational complexity of some of these solution concepts.