WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Language
    অসমীয়া বাংলা भोजपुरी डोगरी English ગુજરાતી हिंदी ಕನ್ನಡ
    Khasi कोंकणी मैथिली മലയാളം ꯃꯤꯇꯩ ꯂꯣꯟ मराठी Mizo नेपाली
    ଓଡ଼ିଆ ਪੰਜਾਬੀ संस्कृत ᱥᱟᱱᱛᱟᱲᱤ सिन्धी தமிழ் తెలుగు اردو
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Computational Mathematics and Modeling
  2. Computational Mathematics and Modeling : Volume 12
  3. Computational Mathematics and Modeling : Volume 12, Issue 2, April 2001
  4. Choice Using Cyclic Tournament Relations
Loading...

Please wait, while we are loading the content...

Computational Mathematics and Modeling : Volume 28
Computational Mathematics and Modeling : Volume 27
Computational Mathematics and Modeling : Volume 26
Computational Mathematics and Modeling : Volume 25
Computational Mathematics and Modeling : Volume 24
Computational Mathematics and Modeling : Volume 23
Computational Mathematics and Modeling : Volume 22
Computational Mathematics and Modeling : Volume 21
Computational Mathematics and Modeling : Volume 20
Computational Mathematics and Modeling : Volume 19
Computational Mathematics and Modeling : Volume 18
Computational Mathematics and Modeling : Volume 17
Computational Mathematics and Modeling : Volume 16
Computational Mathematics and Modeling : Volume 15
Computational Mathematics and Modeling : Volume 14
Computational Mathematics and Modeling : Volume 13
Computational Mathematics and Modeling : Volume 12
Computational Mathematics and Modeling : Volume 12, Issue 4, October 2001
Computational Mathematics and Modeling : Volume 12, Issue 3, July 2001
Computational Mathematics and Modeling : Volume 12, Issue 2, April 2001
A New Model of Thermal Desorption of Nitrogen from a Nonhomogeneous Catalyst Surface
Modeling the CO Oxidation Reaction in a Thin Granular Catalyst Layer
Integral Characteristic Method in the Inverse Problem of Optical Coating Design
Some Issues in the Theory of Optimal Algorithms and Informational Complexity
Choice Using Cyclic Tournament Relations
Vector Minimax from the Viewpoints of the Opponents
Input Modeling in Time-Delayed Systems
Computational Mathematics and Modeling : Volume 12, Issue 1, January 2001
Computational Mathematics and Modeling : Volume 11
Computational Mathematics and Modeling : Volume 10
Computational Mathematics and Modeling : Volume 9
Computational Mathematics and Modeling : Volume 8

Similar Documents

...
With uncertainty by choice of zero dynamics

Article

...
Choice of solution in one-step bimatrix games

Article

...
Investigation of a class of dynamic collective choice procedures

Article

...
Assessing the Level of Compromise in Real Choice Models

Article

...
Mathematical modeling of demographic processes

Article

...
Numerical differentiation using spline functions

Article

...
Numerical Analysis of Ruin Games

Article

...
Computational technique for singular boundary value problems by using Numerical Quadrature

Article

...
Controller design using closed-loop transfer function

Article

Choice Using Cyclic Tournament Relations

Content Provider Springer Nature Link
Author Levchenkov, V. S. Levchenkova, L. G.
Copyright Year 2001
Abstract A new (so-called matched) tournament solution is constructed as a restriction of the well-known Fishburn–Miller set. The options are chosen by applying the Copeland method to a certain collection of subsets of the presentation set that contain at most four elements. The main properties of the matched tournament solution are illustrated with examples. A condition is derived on the choice function identifying the class of matched solutions.
Starting Page 157
Ending Page 168
Page Count 12
File Format PDF
ISSN 1046283X
Journal Computational Mathematics and Modeling
Volume Number 12
Issue Number 2
e-ISSN 1573837X
Language English
Publisher Kluwer Academic Publishers-Plenum Publishers
Publisher Date 2001-01-01
Publisher Place New York
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Applications of Mathematics Computational Mathematics and Numerical Analysis Mathematical Modeling and Industrial Mathematics Optimization
Content Type Text
Resource Type Article
Subject Computational Mathematics
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
Cite this Content
Loading...