Welcome, visitor! [ Login

 

J. Peck, “A Note on Competing Mechanisms and the Revelation Principle,” Mimeo, Ohio State University, 1997. http://economics.sbs.ohio-state.edu/jpeck/reveal.pdf

  • Listed: 31 May 2026 14 h 41 min

Description

J. Peck, “A Note on Competing Mechanisms and the Revelation Principle,” Mimeo, Ohio State University, 1997. http://economics.sbs.ohio-state.edu/jpeck/reveal.pdf

**J. Peck, “A Note on Competing Mechanisms and the Revelation Principle,” Mimeo, Ohio State University, 1997. http://economics.sbs.ohio-state.edu/jpeck/reveal.pdf**

When scholars of economic theory talk about *mechanism design*, the **Revelation Principle** is often the first concept that comes to mind. Yet, the principle is not a one‑size‑fits‑all solution; it coexists with a rich landscape of **competing mechanisms** that can achieve the same outcomes under different informational structures. In his 1997 note, **J. Peck** from Ohio State University provides a concise yet powerful exploration of this interplay, shedding light on why economists should look beyond the classic revelation framework when designing incentives.

### Why the Revelation Principle Matters

At its core, the Revelation Principle states that for any outcome that can be implemented by a complex, possibly indirect mechanism, there exists a **direct, truth‑telling mechanism** that yields the same result. This insight simplifies the analysis of **incentive compatible** contracts, allowing researchers to focus on *direct mechanisms* without loss of generality. In practice, the principle is a cornerstone of **game theory**, **auction design**, and **public policy**—from spectrum auctions to climate agreements.

### Peck’s Insight on Competing Mechanisms

Peck’s note goes a step further by asking: *What happens when multiple mechanisms compete to implement the same social choice function?* He demonstrates that while the Revelation Principle guarantees the existence of a direct mechanism, it does **not** guarantee its dominance in a competitive environment. In other words, a **competing indirect mechanism** might still be preferred by participants because of factors such as simplicity, lower communication costs, or perceived fairness.

Key takeaways from Peck’s analysis include:

1. **Multiplicity of Equilibria** – Different mechanisms can sustain distinct equilibrium strategies, even when they implement identical outcomes.
2. **Strategic Selection** – Agents may strategically select a mechanism that minimizes their own informational burden, favoring indirect designs.
3. **Robustness to Information Asymmetry** – Competing mechanisms can be more robust when players have limited knowledge about each other’s types, a situation where the direct revelation approach may falter.

### Real‑World Applications

Understanding the tension between competing mechanisms and the Revelation Principle has practical implications:

– **Auction Design** – While Vickrey auctions (a direct mechanism) are theoretically optimal, many real‑world auctions employ **first‑price sealed‑bid** formats because they reduce strategic complexity for bidders.
– **Regulatory Policy** – Governments often use **indirect tax incentives** rather than direct subsidies, recognizing that firms may respond more predictably to simpler, less intrusive rules.
– **Digital Platforms** – Online marketplaces design **ranking algorithms** (indirect mechanisms) that influence seller behavior, sometimes outperforming direct price‑setting mechanisms in terms of user engagement.

### The Academic Legacy

Peck’s 1997 note, though brief, has become a frequently cited reference in contemporary **mechanism design literature**. Researchers building on his work explore **robust mechanism design**, **behavioral considerations**, and **computational tractability**—all areas where the competition among mechanisms is a pivotal factor.

### Closing Thoughts

The quote that frames this post points readers to a seminal PDF hosted by **Ohio State University**, a reminder that foundational ideas often reside in modest, mimeographed notes. By revisiting Peck’s insights, economists, policymakers, and students alike can appreciate that the **Revelation Principle** is a powerful tool, but not the sole answer to the complex puzzle of designing effective, real‑world mechanisms.

If you’re interested in diving deeper, download the original paper from the provided link and explore how **competing mechanisms** continue to shape modern economic theory and practice.

*Keywords: mechanism design, revelation principle, J. Peck, competing mechanisms, incentive compatibility, game theory, economic theory, Ohio State University, auction design, public policy.*

No Tags

4 total views, 1 today

  

Listing ID: N/A

Report problem

Processing your request, Please wait....

Sponsored Links

 

T. B. Boffey, “Location Problems Arising in Computer Networks,” Journal of ...

T. B. Boffey, “Location Problems Arising in Computer Networks,” Journal of Operational Research Society, Vol. 40, No. 4, 1989, pp. 347-354. **T. B. Boffey, “Location […]

No views yet

 

M. E. O’Kelly, “The Location of Interacting Hub Facilities,” Transportation...

M. E. O’Kelly, “The Location of Interacting Hub Facilities,” Transportation Science, Vol.20, No.2, 1986, pp. 92- 106. **M. E. O’Kelly, “The Location of Interacting Hub […]

3 total views, 3 today

 

R. Panneerselvam, “Efficient Heuristic for Total Covering Problem,” Product...

R. Panneerselvam, “Efficient Heuristic for Total Covering Problem,” Productivity, Vol. 36, No. 4, 1996, pp. 649- 657. Okay, the user wants me to create a […]

1 total views, 1 today

 

G. Rajkumar and R. Panneerselvam, “An Improved Heuristic for Total Covering...

G. Rajkumar and R. Panneerselvam, “An Improved Heuristic for Total Covering Problem,” Industrial Engineering Journal, Vol. 20, No. 8, 1991, pp. 4-7. None

2 total views, 2 today

 

R. Panneerselvam, “A Heuristic Algorithm for Total Covering Problem,” Indus...

R. Panneerselvam, “A Heuristic Algorithm for Total Covering Problem,” Industrial Engineering Journal, Vol. 19, No. 2, 1990, pp. 1-10. Okay, I need to write a […]

2 total views, 2 today

 

A. W. Neebe, “A Procedure for Locating Emergency- Service Facilities for Al...

A. W. Neebe, “A Procedure for Locating Emergency- Service Facilities for All Possible Response Distances,” Journal of Operational Research Society, Vol. 39, No. 8, 1988, […]

3 total views, 3 today

 

O. Saatcioglu, “Mathematical Programming Model for Airport Site Selection,”...

O. Saatcioglu, “Mathematical Programming Model for Airport Site Selection,” Transportation Research-B, Vol. 16B, No. 6, 1982, pp. 435-447. **O. Saatcioglu, “Mathematical Programming Model for Airport […]

3 total views, 2 today

 

T. D. Klastorin, “On the Maximal Covering Location Pro- blem and the Genera...

T. D. Klastorin, “On the Maximal Covering Location Pro- blem and the Generalized Assignment Problem,” Management Science, Vol. 25, No.1, 1979, pp. 107-111. Okay, I […]

3 total views, 3 today

 

N. R. Patel, “Location of Rural Social Service Centers in India,” Managemen...

N. R. Patel, “Location of Rural Social Service Centers in India,” Management Science, Vol. 25, No. 1, 1979, pp. 22-30. “N. R. Patel, “Location of […]

3 total views, 3 today

 

C. Toregas, R. Swain, C. Revelle and L. Bergman, “The Location of Emergency...

C. Toregas, R. Swain, C. Revelle and L. Bergman, “The Location of Emergency Service Facilities,” Operations Research, Vol. 19, No. 6, 1971, pp. 1363-1373. None

3 total views, 3 today

 

T. B. Boffey, “Location Problems Arising in Computer Networks,” Journal of ...

T. B. Boffey, “Location Problems Arising in Computer Networks,” Journal of Operational Research Society, Vol. 40, No. 4, 1989, pp. 347-354. **T. B. Boffey, “Location […]

No views yet

 

M. E. O’Kelly, “The Location of Interacting Hub Facilities,” Transportation...

M. E. O’Kelly, “The Location of Interacting Hub Facilities,” Transportation Science, Vol.20, No.2, 1986, pp. 92- 106. **M. E. O’Kelly, “The Location of Interacting Hub […]

3 total views, 3 today

 

R. Panneerselvam, “Efficient Heuristic for Total Covering Problem,” Product...

R. Panneerselvam, “Efficient Heuristic for Total Covering Problem,” Productivity, Vol. 36, No. 4, 1996, pp. 649- 657. Okay, the user wants me to create a […]

1 total views, 1 today

 

G. Rajkumar and R. Panneerselvam, “An Improved Heuristic for Total Covering...

G. Rajkumar and R. Panneerselvam, “An Improved Heuristic for Total Covering Problem,” Industrial Engineering Journal, Vol. 20, No. 8, 1991, pp. 4-7. None

2 total views, 2 today

 

R. Panneerselvam, “A Heuristic Algorithm for Total Covering Problem,” Indus...

R. Panneerselvam, “A Heuristic Algorithm for Total Covering Problem,” Industrial Engineering Journal, Vol. 19, No. 2, 1990, pp. 1-10. Okay, I need to write a […]

2 total views, 2 today

 

A. W. Neebe, “A Procedure for Locating Emergency- Service Facilities for Al...

A. W. Neebe, “A Procedure for Locating Emergency- Service Facilities for All Possible Response Distances,” Journal of Operational Research Society, Vol. 39, No. 8, 1988, […]

3 total views, 3 today

 

O. Saatcioglu, “Mathematical Programming Model for Airport Site Selection,”...

O. Saatcioglu, “Mathematical Programming Model for Airport Site Selection,” Transportation Research-B, Vol. 16B, No. 6, 1982, pp. 435-447. **O. Saatcioglu, “Mathematical Programming Model for Airport […]

3 total views, 2 today

 

T. D. Klastorin, “On the Maximal Covering Location Pro- blem and the Genera...

T. D. Klastorin, “On the Maximal Covering Location Pro- blem and the Generalized Assignment Problem,” Management Science, Vol. 25, No.1, 1979, pp. 107-111. Okay, I […]

3 total views, 3 today

 

N. R. Patel, “Location of Rural Social Service Centers in India,” Managemen...

N. R. Patel, “Location of Rural Social Service Centers in India,” Management Science, Vol. 25, No. 1, 1979, pp. 22-30. “N. R. Patel, “Location of […]

3 total views, 3 today

 

C. Toregas, R. Swain, C. Revelle and L. Bergman, “The Location of Emergency...

C. Toregas, R. Swain, C. Revelle and L. Bergman, “The Location of Emergency Service Facilities,” Operations Research, Vol. 19, No. 6, 1971, pp. 1363-1373. None

3 total views, 3 today