Skip to main content

Abstract

We have seen that given any set of preference schedules it is possible to obtain the corresponding matrix. The converse problem is: Given any matrix is it possible to find a corresponding set of schedules?

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. If the total number of voters is known, a further equation is added.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

McLean, I., McMillan, A., Monroe, B.L. (1998). The Converse Problem: The Group of Schedules to Correspond to a Given Voting Matrix. In: McLean, I., McMillan, A., Monroe, B.L. (eds) The Theory of Committees and Elections by Duncan Black and Committee Decisions with Complementary Valuation by Duncan Black and R.A. Newing. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4860-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-4860-3_15

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6036-3

  • Online ISBN: 978-94-011-4860-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics