On the public citation graph

Efficient and strategy-proof social choice when preferences are single-dipped

https://doi.org/10.1007/s00182-013-0396-4
0 signed · 58 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/game.1999.0789openalex-snapshot
Coalitional Strategy-Proofness in Economies with Single-Dipped Preferences and the Assignment of an Indivisible Object
inferredcites →https://doi.org/10.1006/jeth.2001.2807openalex-snapshot
Strategy-proof Location on a Network
inferredcites →https://doi.org/10.1007/s00182-011-0305-7openalex-snapshot
Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results
inferredcites →https://doi.org/10.1007/s00199-013-0785-8openalex-snapshot
On the location of public bads: strategy-proofness under two-dimensional single-dipped preferences
inferredcites →https://doi.org/10.1007/s00355-008-0358-0openalex-snapshot
On the equivalence of coalitional and individual strategy-proofness properties
inferredcites →https://doi.org/10.1007/s00355-011-0624-4openalex-snapshot
Domains, ranges and strategy-proofness: the case of single-dipped preferences
inferredcites →https://doi.org/10.1016/0022-0531(75)90050-2openalex-snapshot
Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions
inferredcites →https://doi.org/10.1016/j.econlet.2013.01.012openalex-snapshot
Strategy-proof location of a public bad on a disc
inferredcites →https://doi.org/10.1016/j.jet.2010.03.006openalex-snapshot
Individual versus group strategy-proofness: When do they coincide?
inferredcites →https://doi.org/10.1016/j.mathsocsci.2006.03.008openalex-snapshot
Strategy-proof voting on the full preference domain
inferredcites →https://doi.org/10.1016/j.mathsocsci.2012.02.003openalex-snapshot
Group strategy-proofness and voting between two alternatives
inferredcites →https://doi.org/10.1016/s0165-1765(97)00097-9openalex-snapshot
Strategy-proof division of a private good when preferences are single-dipped
inferredcites →https://doi.org/10.2307/1914083openalex-snapshot
Manipulation of Voting Schemes: A General Result
inferredcites →https://doi.org/10.2307/2938220openalex-snapshot
Voting by Committees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.2690140openalex-extracted
Strategy-Proof Location of Public Facilities
inferred← citeshttps://doi.org/10.2139/ssrn.3509819openalex-extracted
Locating an Optimal Site for a Controversial Facility
inferred← citeshttps://doi.org/10.1007/978-3-030-33792-6_20openalex-snapshot
SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location
inferred← citeshttps://doi.org/10.1007/978-3-031-21203-1_9openalex-snapshot
False-Name-Proof Facility Location on Wheel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08377-3_13openalex-snapshot
A Survey on Approximation Mechanism Design Without Money for Facility Games
inferred← citeshttps://doi.org/10.1007/978-3-642-41550-0_2openalex-snapshot
Some New Domain Restrictions in Social Choice, and Their Consequences
inferred← citeshttps://doi.org/10.1007/s00182-011-0305-7openalex-snapshot
Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results
inferred← citeshttps://doi.org/10.1007/s00182-020-00728-yopenalex-snapshot
On strategy-proofness and single-peakedness: median-voting over intervals
inferred← citeshttps://doi.org/10.1007/s00199-013-0785-8openalex-snapshot
On the location of public bads: strategy-proofness under two-dimensional single-dipped preferences
inferred← citeshttps://doi.org/10.1007/s00199-023-01550-9openalex-snapshot
Mechanisms and axiomatics for division problems with single-dipped preferences
inferred← citeshttps://doi.org/10.1007/s00355-011-0624-4openalex-snapshot
Domains, ranges and strategy-proofness: the case of single-dipped preferences
inferred← citeshttps://doi.org/10.1007/s00355-015-0907-2openalex-snapshot
Cooperative decision-making for the provision of a locally undesirable facility
inferred← citeshttps://doi.org/10.1007/s00355-016-0957-0openalex-snapshot
Single-dipped preferences with satiation: strong group strategy-proofness and unanimity
inferred← citeshttps://doi.org/10.1007/s00355-016-0987-7openalex-snapshot
Non-bossiness
inferred← citeshttps://doi.org/10.1007/s00355-018-01169-zopenalex-snapshot
Strategy-proof location of public bads in an interval
inferred← citeshttps://doi.org/10.1007/s00355-019-01225-2openalex-snapshot
Upper Set Rules with Binary Ranges
inferred← citeshttps://doi.org/10.1007/s00355-022-01427-1openalex-snapshot
Binary mechanism for the allocation problem with single-dipped preferences
inferred← citeshttps://doi.org/10.1007/s10058-018-0210-7openalex-snapshot
On the terminology of economic design: a critical assessment and some proposals
inferred← citeshttps://doi.org/10.1007/s10458-020-09472-9openalex-snapshot
Strategic facility location problems with linear single-dipped and single-peaked preferences
inferred← citeshttps://doi.org/10.1007/s10898-017-0586-xopenalex-snapshot
Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain
inferred← citeshttps://doi.org/10.1007/s11238-018-9667-7openalex-snapshot
Dictatorship on top-circular domains
inferred← citeshttps://doi.org/10.1007/s40305-016-0117-3openalex-snapshot
Approximation Randomized Strategy-Proof Mechanisms in Obnoxious Facility Game with Weighted Agents
inferred← citeshttps://doi.org/10.1007/s40505-018-0160-9openalex-snapshot
Divide-and-choose with nonmonotonic preferences
inferred← citeshttps://doi.org/10.1016/j.econlet.2013.01.012openalex-snapshot
Strategy-proof location of a public bad on a disc
inferred← citeshttps://doi.org/10.1016/j.geb.2018.06.010openalex-snapshot
Strategy-proof location of public facilities
inferred← citeshttps://doi.org/10.1016/j.geb.2023.03.006openalex-snapshot
Object reallocation problems with single-dipped preferences
inferred← citeshttps://doi.org/10.1016/j.geb.2024.05.011openalex-snapshot
Strategy-proofness with single-peaked and single-dipped preferences
inferred← citeshttps://doi.org/10.1016/j.geb.2024.08.001openalex-snapshot
Revealed preference domains from random choice
inferred← citeshttps://doi.org/10.1016/j.geb.2025.11.003openalex-snapshot
Group incentive-compatible allocation of discrete resources when ownership is partitioned
inferred← citeshttps://doi.org/10.1016/j.jet.2016.03.011openalex-snapshot
Ordinal Bayesian incentive compatibility in restricted domains
inferred← citeshttps://doi.org/10.1016/j.jmateco.2013.12.010openalex-snapshot
Single-basined choice
inferred← citeshttps://doi.org/10.1016/j.jmateco.2016.05.001openalex-snapshot
Coalitional stability in the location problem with single-dipped preferences: An application of the minimax theorem
inferred← citeshttps://doi.org/10.1016/j.jmateco.2017.01.003openalex-snapshot
An extreme point characterization of strategy-proof and unanimous probabilistic rules over binary restricted domains
inferred← citeshttps://doi.org/10.1016/j.jmateco.2024.103048openalex-snapshot
Fair and efficient allocations when preferences are single-dipped
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2012.02.003openalex-snapshot
Group strategy-proofness and voting between two alternatives
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2016.07.001openalex-snapshot
Strategy-proof location of public bads in a two-country model
inferred← citeshttps://doi.org/10.1016/s0169-7218(10)00025-0openalex-snapshot
Strategyproof Social Choice
inferred← citeshttps://doi.org/10.2139/ssrn.5277068openalex-snapshot
A Classification of Domains: Single-Crossing Approach
inferred← citeshttps://doi.org/10.2139/ssrn.6269363openalex-snapshot
Locating two (noxious) public facilities on two adjacent streets
inferred← citeshttps://doi.org/10.26481/dis.20160914alopenalex-snapshot
Strategy-proof location of public bads
inferred← citeshttps://doi.org/10.26481/dis.20220927dgopenalex-snapshot
Cooperative Games and Mechanisms for Division Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1907.08914openalex-snapshot
False-Name-Proof Facility Location on Discrete Structures
inferred← citeshttps://doi.org/10.5539/ijef.v8n4p80openalex-snapshot
Population Monotonicity in Public Good Economies with Single Dipped Preferences
inferred← citeshttps://doi.org/10.7916/d8377916openalex-snapshot
Optimization in Strategic Environments
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.