Chapter 7. Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality
- Vangelis Th. Paschos
Published Online: 3 FEB 2010
DOI: 10.1002/9780470611098.ch7
Copyright © 2008 ISTE Ltd.
Book Title
Combinatorial Optimization and Theoretical Computer Science
Additional Information
How to Cite
Chevaleyre, Y., Endriss, U. and Maudet, N. (2010) Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch7
Publication History
- Published Online: 3 FEB 2010
- Published Print: 1 JAN 2008
ISBN Information
Print ISBN: 9781848210219
Online ISBN: 9780470611098
- Summary
- Chapter
- References
Keywords:
- observation satellites;
- industrial procurement;
- allocation process;
- determination problem;
- system designer
Summary
This chapter contains sections titled:
Introduction
Myopic negotiation over indivisible resources
Convergence for restricted classes of utility functions
Modular utility functions and variants
Sufficient classes of utility functions
Necessity issues
Maximal classes of utility functions
Conclusion
Bibliography