7. Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality

  1. Vangelis Th. Paschos
  1. Yann Chevaleyre,
  2. Ulle Endriss and
  3. Nicolas Maudet

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch7

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Chevaleyre, Y., Endriss, U. and Maudet, N. (2008) 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

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

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