IDEAS home Printed from https://ideas.repec.org/f/pra378.html
   My authors  Follow this author

Eve Ramaekers

Personal Details

First Name:Eve
Middle Name:
Last Name:Ramaekers
Suffix:
RePEc Short-ID:pra378
http://www.core.ucl.ac.be/~ramaekers

Affiliation

Center for Operations Research and Econometrics (CORE)
École des Sciences Économiques de Louvain
Université Catholique de Louvain

Louvain-la-Neuve, Belgium
http://www.uclouvain.be/en-core.html

: 32(10)474321
32(10)474301
34 VOIE DU ROMAN PAYS, 1348 LOUVAIN-LA-NEUVE
RePEc:edi:coreebe (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. RAMAEKERS, Eve, 2010. "Fair allocation of indivisible goods among two agents," CORE Discussion Papers 2010087, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  2. RAMAEKERS, Eve & KAYI, Cagatay, 2008. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," CORE Discussion Papers 2008084, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  3. Kayi Çağatay & Ramaekers Eve, 2008. "An Impossibility in Sequencing Problems," Research Memorandum 040, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

Articles

  1. Eve Ramaekers, 2013. "Fair allocation of indivisible goods: the two-agent case," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(2), pages 359-380, July.
  2. KayI, Çagatay & Ramaekers, Eve, 2010. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," Games and Economic Behavior, Elsevier, vol. 68(1), pages 220-232, January.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. RAMAEKERS, Eve, 2010. "Fair allocation of indivisible goods among two agents," CORE Discussion Papers 2010087, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Eve Ramaekers, 2013. "Fair allocation of indivisible goods: the two-agent case," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(2), pages 359-380, July.

  2. RAMAEKERS, Eve & KAYI, Cagatay, 2008. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," CORE Discussion Papers 2008084, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Duygu Yengin & Youngsub Chun, 2015. "Welfare Lower Bounds and Strategyproofness in the Queueing Problem," School of Economics Working Papers 2015-11, University of Adelaide, School of Economics.
    2. Dominik Kress & Sebastian Meiswinkel & Erwin Pesch, 2018. "Mechanism design for machine scheduling problems: classification and literature overview," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 583-611, July.
    3. Anouar El Haji & Sander Onderstal, 2015. "Trading Places: An Experimental Comparison of Reallocation Mechanisms for Priority Queuing," Tinbergen Institute Discussion Papers 15-063/VII, Tinbergen Institute.
    4. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2017. "Reordering an existing queue," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(1), pages 65-87, June.
    5. Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 473-480, March.
    6. Bloch, Francis, 2017. "Second-best mechanisms in queuing problems without transfers:The role of random priorities," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 73-79.
    7. Chun, Youngsub & Yengin, Duygu, 2017. "Welfare lower bounds and strategy-proofness in the queueing problem," Games and Economic Behavior, Elsevier, vol. 102(C), pages 462-476.
    8. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2014. "Egalitarian equivalence and strategyproofness in the queueing problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 425-442, June.
    9. Duygu Yengin, 2017. "No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 81-108, January.
    10. Mitra, Manipushpak & De, Parikshit, 2015. "Incentives and justice for sequencing problems," MPRA Paper 65447, University Library of Munich, Germany.
    11. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
    12. Chun, Youngsub & Mitra, Manipushpak & Mutuswami, Suresh, 2014. "Characterizations of pivotal mechanisms in the queueing problem," Mathematical Social Sciences, Elsevier, vol. 72(C), pages 62-66.

Articles

  1. Eve Ramaekers, 2013. "Fair allocation of indivisible goods: the two-agent case," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(2), pages 359-380, July.

    Cited by:

    1. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare,in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506 Elsevier.
    2. Brams, Steven J. & Kilgour, D. Marc & Klamler, Christian, 2014. "An algorithm for the proportional division of indivisible items," MPRA Paper 56587, University Library of Munich, Germany.

  2. KayI, Çagatay & Ramaekers, Eve, 2010. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," Games and Economic Behavior, Elsevier, vol. 68(1), pages 220-232, January.
    See citations under working paper version above.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 2 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-GTH: Game Theory (1) 2011-02-12

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Eve Ramaekers should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.