WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. SIAM Journal on Computing (SMJCAT)
  2. Volume 44
  3. Volume 44 Issue 5 (Special Section on the Fifty-Third Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012))
  4. Optimal Impartial Selection
Loading...

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

Volume 47
Volume 46
Volume 45
Volume 44
Volume 44 Issue 6
Volume 44 Issue 5 (Special Section on the Fifty-Third Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012))
Constructive Discrepancy Minimization by Walking on the Edges
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
How to Compute in the Presence of Leakage
New Limits to Classical and Quantum Instance Compression
Diffusive Influence Systems
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
Making the Long Code Shorter
Special Section on the Fifty-Third IEEE Annual Symposium on Foundations of Computer Science (FOCS 2012)
Optimal Impartial Selection
Quantum Locally Testable Codes
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication
Volume 44 Issue 4
Volume 44 Issue 3
Volume 44 Issue 2
Volume 44 Issue 1
Volume 43
Volume 42
Volume 41
Volume 40
Volume 39
Volume 38
Volume 37
Volume 36
Volume 35
Volume 34
Volume 33
Volume 32
Volume 31
Volume 30
Volume 29
Volume 28
Volume 27
Volume 26
Volume 25
Volume 24
Volume 23
Volume 22
Volume 21
Volume 20
Volume 19
Volume 18
Volume 17
Volume 16
Volume 15
Volume 14
Volume 13
Volume 12
Volume 11
Volume 10
Volume 9
Volume 8
Volume 7
Volume 6
Volume 5
Volume 4
Volume 3
Volume 2
Volume 1

Similar Documents

...
Optimal impartial selection

Article

...
An Algorithmic View of Voting

Article

...
Paradoxical examples of social networks games with product choice

Article

...
Equilibria in Online Games

Article

...
A Survey on Approximation Mechanism Design without Money for Facility Games

Article

...
Nash Equilibria in certain two-choice multi-player games played on the ladder graph

Article

...
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game

Article

...
The graph energy game

Article

...
Refinement of the Equilibrium of Public Goods Games over Networks: Efficiency and Effort of Specialized Equilibria

Article

Optimal Impartial Selection

Content Provider Society for Industrial and Applied Mathematics (SIAM)
Author Fischer, Felix Klimm, Max
Copyright Year 2015
Abstract We study a fundamental problem in social choice theory, the selection of a member of a set of agents based on impartial nominations by agents from that set. Studied previously by Alon et al. [Proceedings of TARK, 2011, pp. 101--110] and by Holzman and Moulin [Econometrica, 81 (2013), pp. 173--196], this problem arises when representatives are selected from within a group or when publishing or funding decisions are made based on a process of peer review. Our main result concerns a randomized mechanism that in expectation selects an agent with at least half the maximum number of nominations. This is best possible subject to impartiality and resolves a conjecture of Alon et al. Further results are given for the case where some agent receives many nominations and the case where each agent casts at least one nomination.
Starting Page 1263
Ending Page 1285
Page Count 23
File Format PDF
ISSN 00975397
DOI 10.1137/140995775
e-ISSN 10957111
Journal SIAM Journal on Computing (SMJCAT)
Issue Number 5 (Special Section on the Fifty-Third Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012))
Volume Number 44
Language English
Publisher Society for Industrial and Applied Mathematics
Publisher Date 2015-10-20
Access Restriction Subscribed
Subject Keyword impartial selection social choice Voting theory Social choice approximation Games involving graphs voting Approximation algorithms impartiality
Content Type Text
Resource Type Article
Subject Mathematics Computer Science
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
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
I will try my best to help you...
Cite this Content
Loading...