Nothing Special   »   [go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/f/pra378.html
   My authors  Follow this author

Eve Ramaekers

(We have lost contact with this author. Please ask them to update the entry or send us the correct address or status for this person. Thank you.)

Personal Details

First Name:Eve
Middle Name:
Last Name:Ramaekers
Suffix:
RePEc Short-ID:pra378
The above email address does not seem to be valid anymore. Please ask Eve Ramaekers to update the entry or send us the correct address or status for this person. Thank you.
http://www.core.ucl.ac.be/~ramaekers

Affiliation

Center for Operations Research and Econometrics (CORE)
Louvain Institute of Data Analysis and Modelling in Economics and Statistics (LIDAM)
Université Catholique de Louvain

Louvain-la-Neuve, Belgium
http://www.uclouvain.be/en-core.html
RePEc:edi:coreebe (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. MUKHERJEE Saptarshi & MUTO Nozomu & RAMAEKERS Eve, 2017. "Implementation in undominated strategies with partially honest agents," LIDAM Discussion Papers CORE 2017011, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  2. RAMAEKERS, Eve, 2013. "Fair allocation of indivisible goods: the two-agent case," LIDAM Reprints CORE 2483, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  3. RAMAEKERS, Eve, 2010. "Fair allocation of indivisible goods among two agents," LIDAM Discussion Papers CORE 2010087, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  4. RAMAEKERS, Eve & KAYI, Cagatay, 2008. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," LIDAM Discussion Papers CORE 2008084, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  5. Kayi, C. & Ramaekers, E., 2008. "An impossibility in sequencing problems," Research Memorandum 040, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

Articles

  1. Mukherjee, Saptarshi & Muto, Nozomu & Ramaekers, Eve & Sen, Arunava, 2019. "Implementation in undominated strategies by bounded mechanisms: The Pareto correspondence and a generalization," Journal of Economic Theory, Elsevier, vol. 180(C), pages 229-243.
  2. Mukherjee, Saptarshi & Muto, Nozomu & Ramaekers, Eve, 2017. "Implementation in undominated strategies with partially honest agents," Games and Economic Behavior, Elsevier, vol. 104(C), pages 613-631.
  3. 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.
  4. 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. MUKHERJEE Saptarshi & MUTO Nozomu & RAMAEKERS Eve, 2017. "Implementation in undominated strategies with partially honest agents," LIDAM Discussion Papers CORE 2017011, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Lombardi, Michele & Yoshihara, Naoki, 2018. "Partially-Honest Nash Implementation: A Full Characterization," Discussion Paper Series 682, Institute of Economic Research, Hitotsubashi University.
    2. Mukherjee, Saptarshi, 2018. "Implementation in undominated strategies by bounded mechanisms: Some results on compromise alternatives," Research in Economics, Elsevier, vol. 72(3), pages 384-391.
    3. Mukherjee, Saptarshi & Muto, Nozomu & Sen, Arunava, 2024. "Implementation in undominated strategies with applications to auction design, public good provision and matching," Journal of Economic Theory, Elsevier, vol. 216(C).
    4. Hitoshi Matsushima, 2020. "Implementation, Honesty, and Common Knowledge," CARF F-Series CARF-F-500, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    5. Hitoshi Matsushima, 2021. "Epistemological Implementation of Social Choice Functions," CARF F-Series CARF-F-518, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    6. Hitoshi Matsushima, 2022. "Honesty and Epistemological Implementation of Social Choice Functions with Asymmetric Information," CARF F-Series CARF-F-548, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    7. Savva, Foivos, 2018. "Strong implementation with partially honest individuals," Journal of Mathematical Economics, Elsevier, vol. 78(C), pages 27-34.
    8. Mukherjee, Saptarshi & Muto, Nozomu & Ramaekers, Eve & Sen, Arunava, 2019. "Implementation in undominated strategies by bounded mechanisms: The Pareto correspondence and a generalization," Journal of Economic Theory, Elsevier, vol. 180(C), pages 229-243.
    9. Altun, Ozan Altuğ & Barlo, Mehmet & Dalkıran, Nuh Aygün, 2023. "Implementation with a sympathizer," Mathematical Social Sciences, Elsevier, vol. 121(C), pages 36-49.
    10. Hagiwara, Makoto, 2019. "Double implementation without no-veto-power," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 124-130.
    11. Savva, Foivos, 2021. "Motives and implementation with rights structures," Economics Letters, Elsevier, vol. 204(C).
    12. Hagiwara, Makoto, 2018. "A simple mechanism for double implementation with semi-socially-responsible agents," Economics Letters, Elsevier, vol. 171(C), pages 51-53.

  2. RAMAEKERS, Eve, 2013. "Fair allocation of indivisible goods: the two-agent case," LIDAM Reprints CORE 2483, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    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.

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

    Cited by:

    1. RAMAEKERS, Eve, 2013. "Fair allocation of indivisible goods: the two-agent case," LIDAM Reprints CORE 2483, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

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

    Cited by:

    1. Yengin, Duygu & Chun, Youngsub, 2020. "No-envy, solidarity, and strategy-proofness in the queueing problem," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 87-97.
    2. Erwin Ooghe, 2019. "Markets, Queues, and Taxes," CESifo Working Paper Series 7910, CESifo.
    3. Anouar El Haji & Sander Onderstal, 2019. "Trading places: An experimental comparison of reallocation mechanisms for priority queuing," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(4), pages 670-686, November.
    4. 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.
    5. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2019. "Recent developments in the queueing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 1-23, April.
    6. Atay, Ata & Trudeau, Christian, 2024. "Queueing games with an endogenous number of machines," Games and Economic Behavior, Elsevier, vol. 144(C), pages 104-125.
    7. Yu Zhou & Youngsub Chun & Shigehiro Serizawa, 2022. "A characterization of the Vickrey rule in slot allocation problems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 38-49, March.
    8. Mitra, Manipushpak & De, Parikshit, 2015. "Incentives and justice for sequencing problems," MPRA Paper 65447, University Library of Munich, Germany.
    9. Duygu Yengin & Youngsub Chun, 2015. "Welfare Lower Bounds and Strategyproofness in the Queueing Problem," School of Economics and Public Policy Working Papers 2015-11, University of Adelaide, School of Economics and Public Policy.
    10. Chun, Youngsub & Mitra, Manipushpak & Mutuswami, Suresh, 2019. "A characterization of the symmetrically balanced VCG rule in the queueing problem," Games and Economic Behavior, Elsevier, vol. 118(C), pages 486-490.
    11. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2023. "Balanced VCG mechanisms for sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 35-46, January.
    12. 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.
    13. 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.
    14. 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.
    15. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
    16. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Egalitarian Equivalence And Strategyproofness In The Queueing Problem," Discussion Papers in Economics 13/16, Division of Economics, School of Business, University of Leicester.
    17. Chun, Youngsub & Mitra, Manipushpak & Mutuswami, Suresh, 2019. "Egalitarianism in the queueing problem," Journal of Mathematical Economics, Elsevier, vol. 81(C), pages 48-56.
    18. 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.
    19. Banerjee, Sreoshi & De, Parikshit & Mitra, Manipushpak, 2020. "A welfarist approach to sequencing problems with incentives," MPRA Paper 107188, University Library of Munich, Germany.
    20. Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
    21. 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. Mukherjee, Saptarshi & Muto, Nozomu & Ramaekers, Eve & Sen, Arunava, 2019. "Implementation in undominated strategies by bounded mechanisms: The Pareto correspondence and a generalization," Journal of Economic Theory, Elsevier, vol. 180(C), pages 229-243.

    Cited by:

    1. Mukherjee, Saptarshi, 2018. "Implementation in undominated strategies by bounded mechanisms: Some results on compromise alternatives," Research in Economics, Elsevier, vol. 72(3), pages 384-391.
    2. Korpela, Ville & Lombardi, Michele & Saulle, Riccardo D., 2024. "Designing rotation programs: Limits and possibilities," Games and Economic Behavior, Elsevier, vol. 143(C), pages 77-102.
    3. Mukherjee, Saptarshi & Muto, Nozomu & Sen, Arunava, 2024. "Implementation in undominated strategies with applications to auction design, public good provision and matching," Journal of Economic Theory, Elsevier, vol. 216(C).

  2. Mukherjee, Saptarshi & Muto, Nozomu & Ramaekers, Eve, 2017. "Implementation in undominated strategies with partially honest agents," Games and Economic Behavior, Elsevier, vol. 104(C), pages 613-631.
    See citations under working paper version above.
  3. 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.
    See citations under working paper version above.
  4. 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
  2. NEP-MIC: Microeconomics (1) 2017-04-30

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. RePEc uses bibliographic data supplied by the respective publishers.