PROBABILITY CALCULATIONS UNDER THE IAC HYPOTHESIS

Unknown author

53 citations0/0 files stored

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Voting Systems Complexity and Algorithms in Graphs Advanced Combinatorial Mathematics

Abstract

Abstract. We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several illustrative examples are given. 1.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 53 citations exist upstream.

References

1983Condorcet's paradox 2007On Ehrhart polynomials and probability calculations in voting theory 1997CONDORCET'S PARADOX AND THE CONDORCET EFFICIENCY OF VOTING RULES.2002Condorcet's paradox and the likelihood of its occurrence: different perspectives on balanced preferences*2006Some Further Results on the Manipulability of Social Choice Rules 2005Which Scoring Rule Maximizes Condorcet Efficiency Under Iac?

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.