IDEAS home Printed from https://ideas.repec.org/e/c/pmi124.html
   My authors  Follow this author

Debasis Mishra

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. Sushil Bikhchandani & Debasis Mishra, 2020. "Selling Two Identical Objects," Papers 2009.11545, arXiv.org, revised Aug 2021.

    Cited by:

    1. Dirk Bergemann & Alessandro Bonatti & Andreas Haupt & Alex Smolin, 2021. "The Optimality of Upgrade Pricing," Papers 2107.10323, arXiv.org, revised Dec 2021.
    2. Komal Malik & Kolagani Paramahamsa, 2024. "Selling two complementary goods," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(2), pages 423-447, June.
    3. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Discussion Papers 22-02, Indian Statistical Institute, Delhi.
    4. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Papers 2202.10378, arXiv.org, revised Oct 2024.
    5. Rochet, Jean-Charles, 2024. "Multidimensional Screening After 37 years," TSE Working Papers 24-1536, Toulouse School of Economics (TSE).

  2. Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Papers 2009.13104, arXiv.org, revised May 2021.

    Cited by:

    1. Majumdar, Dipjyoti & Roy, Souvik, 2021. "Ordinally Bayesian incentive compatible probabilistic voting rules," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 11-27.
    2. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).

  3. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Mechanism design without quasilinearity," ISER Discussion Paper 1005, Institute of Social and Economic Research, Osaka University.

    Cited by:

    1. Ryosuke Sakai & Shigehiro Serizawa, 2023. "Strategy-proof mechanism design with non-quasi-linear preferences: ex-post revenue maximization for an arbitrary number of objects," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 103-120, January.
    2. Jon X. Eguia & Dimitrios Xefteris, 2018. "Implementation by vote-buying mechanisms," University of Cyprus Working Papers in Economics 04-2018, University of Cyprus Department of Economics.
    3. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object allocation: Ex-post revenue maximization with no wastage," Working Papers e116, Tokyo Center for Economic Research.
    4. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    5. Komal Malik & Debasis Mishra, 2018. "Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity," Discussion Papers 18-06, Indian Statistical Institute, Delhi.
    6. Paul H. Edelman & John A. Weymark, 2021. "Dominant strategy implementability and zero length cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(4), pages 1091-1120, November.
    7. Groh, Carl-Christian & Reuter, Marco, 2023. "Mechanism design for unequal societies," ZEW Discussion Papers 23-050, ZEW - Leibniz Centre for European Economic Research.
    8. Baisa, Brian, 2020. "Efficient multi-unit auctions for normal goods," Theoretical Economics, Econometric Society, vol. 15(1), January.
    9. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," Discussion Papers 17-03, Indian Statistical Institute, Delhi.
    10. Yuya Wakabayashi & Ryosuke Sakai & Hiroki Shinozaki, 2024. "Strategy-proof allocation problem with hard budget constraints and income effects: weak efficiency and fairness," OSIPP Discussion Paper 24E003, Osaka School of International Public Policy, Osaka University.
    11. Velez, Rodrigo A., 2023. "Equitable rent division on a soft budget," Games and Economic Behavior, Elsevier, vol. 139(C), pages 1-14.

  4. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object allocation: Ex-post revenue maximization with no wastage," Working Papers e116, Tokyo Center for Economic Research.

    Cited by:

    1. Yu Zhou & Shigehiro Serizawa, 2019. "Minimum price equilibrium in the assignment market," ISER Discussion Paper 1047, Institute of Social and Economic Research, Osaka University.
    2. Chatterji, Shurojit & Zeng, Huaxia, 2019. "Random mechanism design on multidimensional domains," Journal of Economic Theory, Elsevier, vol. 182(C), pages 25-105.

  5. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," Discussion Papers 17-03, Indian Statistical Institute, Delhi.

    Cited by:

    1. Yu Zhou & Shigehiro Serizawa, 2019. "Minimum price equilibrium in the assignment market," ISER Discussion Paper 1047, Institute of Social and Economic Research, Osaka University.
    2. Chatterji, Shurojit & Zeng, Huaxia, 2019. "Random mechanism design on multidimensional domains," Journal of Economic Theory, Elsevier, vol. 182(C), pages 25-105.

  6. Lars EHLERS & Dipjyoti MAJUMDAR & Debasis MISHRA & Arunava SEN, 2016. "Continuity and Incentive Compatibility in Cardinal Voting Mechanisms," Cahiers de recherche 04-2016, Centre interuniversitaire de recherche en économie quantitative, CIREQ.

    Cited by:

    1. Semin Kim, 2016. "Ordinal Versus Cardinal Voting Rules: A Mechanism Design Approach," Working papers 2016rwp-94, Yonsei University, Yonsei Economics Research Institute.

  7. Debasis Mishra & Tridib Sharma, 2016. "Balanced ranking mechanisms," Discussion Papers 16-04, Indian Statistical Institute, Delhi.

    Cited by:

    1. Sambuddha Ghosh & Yan Long & Manipushpak Mitra, 2021. "Prior-free online mechanisms for queueing with arrivals," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(2), pages 671-700, September.
    2. Debasis Mishra & Tridib Sharma, 2016. "Balanced ranking mechanisms," Discussion Papers 16-04, Indian Statistical Institute, Delhi.
    3. John Wooders & Matt Van Essen, 2018. "Dual Auctions for Assigning Winners and Compensating Losers," Working Papers 20180013, New York University Abu Dhabi, Department of Social Science, revised Jan 2018.
    4. Manea, Mihai & Maskin, Eric, 2023. "Withholding and damage in Bayesian trade mechanisms," Games and Economic Behavior, Elsevier, vol. 142(C), pages 243-265.
    5. Debasis Mishra & Tridib Sharma, 2018. "A simple budget-balanced mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 147-170, January.
    6. Yan Long, 2020. "Optimal budget-balanced ranking mechanisms to assign identical objects," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 467-502, September.
    7. Yan Long, 2018. "Envy-free and budget-balanced assignment of identical objects," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(4), pages 705-719, April.

  8. EHLERS, Lars & MAJUMDAR, Dipjyoti & MISHRA, Debasis & SEN, Arunava, 2016. "Continuity and incentive compatibility," Cahiers de recherche 2016-04, Universite de Montreal, Departement de sciences economiques.

    Cited by:

    1. Semin Kim, 2016. "Ordinal Versus Cardinal Voting Rules: A Mechanism Design Approach," Working papers 2016rwp-94, Yonsei University, Yonsei Economics Research Institute.
    2. Katherine Cuff & Sunghoon Hong & Jesse Schwartz & Quan Wen & John Weymark, 2012. "Dominant strategy implementation with a convex product space of valuations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 567-597, July.

  9. Debasis Mishra, 2016. "Ordinal Bayesian incentive compatibility in restricted domains," Discussion Papers 16-02, Indian Statistical Institute, Delhi.

    Cited by:

    1. Karmokar, Madhuparna & Roy, Souvik, 2020. "The structure of (local) ordinal Bayesian incentive compatible random rules," MPRA Paper 103494, University Library of Munich, Germany.
    2. Sulagna Dasgupta & Debasis Mishra, 2022. "Ordinal Bayesian incentive compatibility in random assignment model," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 651-664, December.
    3. Chatterji, Shurojit & Zeng, Huaxia, 2019. "Random mechanism design on multidimensional domains," Journal of Economic Theory, Elsevier, vol. 182(C), pages 25-105.
    4. Roy, Souvik & Sadhukhan, Soumyarup, 2020. "On the equivalence of strategy-proofness and upper contour strategy-proofness for randomized social choice functions," MPRA Paper 104405, University Library of Munich, Germany.
    5. Nozomu Muto & Shin Sato, 2016. "A decomposition of strategy-proofness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(2), pages 277-294, August.
    6. Majumdar, Dipjyoti & Roy, Souvik, 2021. "Ordinally Bayesian incentive compatible probabilistic voting rules," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 11-27.
    7. Madhuparna Karmokar & Souvik Roy, 2023. "The structure of (local) ordinal Bayesian incentive compatible random rules," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(1), pages 111-152, July.
    8. Lang, Xu & Mishra, Debasis, 2024. "Symmetric reduced form voting," Theoretical Economics, Econometric Society, vol. 19(2), May.
    9. Muto, Nozomu & Sato, Shin, 2017. "An impossibility under bounded response of social choice functions," Games and Economic Behavior, Elsevier, vol. 106(C), pages 1-15.
    10. Miho Hong & Semin Kim, 2018. "Unanimity and Local Incentive Compatibility," Working papers 2018rwp-138, Yonsei University, Yonsei Economics Research Institute.
    11. Xu Lang & Debasis Mishra, 2022. "Symmetric reduced form voting," Papers 2207.09253, arXiv.org, revised Apr 2023.
    12. Miho Hong & Semin Kim, 2023. "Unanimity and local incentive compatibility in sparsely connected domains," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(2), pages 385-411, August.
    13. Debasis Mishra & Xu Lang, 2022. "Symmetric reduced form voting," Discussion Papers 22-03, Indian Statistical Institute, Delhi.
    14. Dipjyoti Majumdar & Arunava Sen, 2021. "Robust incentive compatibility of voting rules with positively correlated beliefs," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 63-95, July.
    15. Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Papers 2009.13104, arXiv.org, revised May 2021.
    16. Bose, Abhigyan & Roy, Souvik, 2023. "Ordinal Bayesian incentive-compatible voting rules with correlated belief under betweenness property," Economics Letters, Elsevier, vol. 229(C).

  10. Debasis Mishra & Anup Pramanik & Souvik Roy, 2016. "Local incentive compatibility with transfers," Discussion Papers 16-01, Indian Statistical Institute, Delhi.

    Cited by:

    1. André Berger & Rudolf Müller & Seyed Hossein Naeemi, 2017. "Characterizing implementable allocation rules in multi-dimensional environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 367-383, February.
    2. Roy, Souvik & Kumar, Ujjwal, 2021. "Local incentive compatibility in non-convex type-spaces," MPRA Paper 110872, University Library of Munich, Germany.
    3. Mishra, Debasis, 2016. "Ordinal Bayesian incentive compatibility in restricted domains," Journal of Economic Theory, Elsevier, vol. 163(C), pages 925-954.
    4. Kumar, Ujjwal & Roy, Souvik, 2024. "Local incentive compatibility on gross substitutes and other non-convex type-spaces," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    5. Kumar, Ujjwal & Roy, Souvik, 2021. "Local incentive compatibility in ordinal type-spaces," MPRA Paper 110994, University Library of Munich, Germany.

  11. Rahul Deb & Debasis Mishra, 2014. "Implementation with contingent contracts," Discussion Papers 14-01, Indian Statistical Institute, Delhi.

    Cited by:

    1. Hitoshi Matsushima, 2018. "Implementation without Expected Utility: Ex-Post Verifiability," CARF F-Series CARF-F-443, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    2. Pan, Lijun & Wang, Dazhong, 2021. "The broker-optimal bilateral trading mechanisms with linear contracts," Economics Letters, Elsevier, vol. 208(C).
    3. Hitoshi Matsushima, 2015. "Implementation, Verification, and Detection," CIRJE F-Series CIRJE-F-991, CIRJE, Faculty of Economics, University of Tokyo.
    4. Liu, Tingjun & Bernhardt, Dan, 2019. "Optimal equity auctions with two-dimensional types," Journal of Economic Theory, Elsevier, vol. 184(C).
    5. Yoon, Kiho, 2020. "Implementability with contingent contracts," Economics Letters, Elsevier, vol. 188(C).
    6. Hitoshi Matsushima, 2017. "Dynamic Implementation, Verification, and Detection," CIRJE F-Series CIRJE-F-1058, CIRJE, Faculty of Economics, University of Tokyo.
    7. Wong, Tak-Yuen & Wong, Ho-Po Crystal, 2023. "Securities auctions with pre-project information management," International Journal of Industrial Organization, Elsevier, vol. 88(C).
    8. Liu, Heng, 2018. "Efficient dynamic mechanisms in environments with interdependent valuations: the role of contingent transfers," Theoretical Economics, Econometric Society, vol. 13(2), May.
    9. Tingjun Liu & Dan Bernhardt, 2021. "Rent Extraction with Securities Plus Cash," Journal of Finance, American Finance Association, vol. 76(4), pages 1869-1912, August.
    10. Pawe{l} Dziewulski & Joshua Lanier & John K. -H. Quah, 2024. "Revealed preference and revealed preference cycles: a survey," Papers 2405.08459, arXiv.org.
    11. Mitra, Manipushpak & De, Parikshit, 2015. "Incentives and justice for sequencing problems," MPRA Paper 65447, University Library of Munich, Germany.
    12. Yingkai Li & Jonathan Libgober, 2023. "Implementing Evidence Acquisition: Time Dependence in Contracts for Advice," Papers 2310.19147, arXiv.org, revised Sep 2024.

  12. Rahul Deb & Debasis Mishra, 2013. "Implementation with Securities," Working Papers tecipa-484, University of Toronto, Department of Economics.

    Cited by:

    1. Tymofiy Mylovanov & Andriy Zapechelnyuk, 2016. "Optimal Allocation With Ex-Post Verification And Limited Penalties," Working Papers 2016_21, Business School - Economics, University of Glasgow.

  13. Thierry Marchant & Debasis Mishra, 2012. "Mechanism design with two alternatives in Quasi-linear environment," Discussion Papers 12-05, Indian Statistical Institute, Delhi.

    Cited by:

    1. Makoto Hagiwara & Hirofumi Yamamura, 2020. "Upper set rules with binary ranges," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(4), pages 657-666, April.
    2. Marchant, T. & Mishra, D., 2018. "The characterization of affine maximizers on restricted domains with two alternatives," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1038-1043.
    3. Conan Mukherjee, 2020. "On group strategyproof and optimal object allocation," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(2), pages 289-304, October.
    4. Jon X. Eguia & Dimitrios Xefteris, 2018. "Implementation by vote-buying mechanisms," University of Cyprus Working Papers in Economics 04-2018, University of Cyprus Department of Economics.
    5. Mishra, Debasis & Nath, Swaprava & Roy, Souvik, 2018. "Separability and decomposition in mechanism design with transfers," Games and Economic Behavior, Elsevier, vol. 109(C), pages 240-261.
    6. Kazuhiko Hashimoto & Kohei Shiozawa, 2016. "Strategy-Proof Probabilistic Mechanisms for Public Decision with Money," ISER Discussion Paper 0964, Institute of Social and Economic Research, Osaka University.
    7. De, Parikshit & Mitra, Manipushpak, 2019. "Balanced implementability of sequencing rules," Games and Economic Behavior, Elsevier, vol. 118(C), pages 342-353.
    8. Abhinaba Lahiri & Anup Pramanik, 2020. "On strategy-proof social choice between two alternatives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(4), pages 581-607, April.
    9. Debasis Mishra & Abdul Quadir, 2014. "Non-bossy single object auctions," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 93-110, April.

  14. Debasis Mishra & Souvik Roy, 2011. "Strategy-proof partitioning," Discussion Papers 11-06, Indian Statistical Institute, Delhi.

    Cited by:

    1. Karmokar, Madhuparna & Roy, Souvik, 2020. "The structure of (local) ordinal Bayesian incentive compatible random rules," MPRA Paper 103494, University Library of Munich, Germany.
    2. Madhuparna Karmokar & Souvik Roy, 2023. "The structure of (local) ordinal Bayesian incentive compatible random rules," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(1), pages 111-152, July.
    3. Chatterji, Shurojit & Zeng, Huaxia, 2018. "On random social choice functions with the tops-only property," Games and Economic Behavior, Elsevier, vol. 109(C), pages 413-435.

  15. Debasis Mishra & Souvik Roy, 2011. "Implementation in multidimensional dichotomous domains," Discussion Papers 11-15, Indian Statistical Institute, Delhi.

    Cited by:

    1. Kos, Nenad & Messner, Matthias, 2013. "Incentive compatibility in non-quasilinear environments," Economics Letters, Elsevier, vol. 121(1), pages 12-14.
    2. Ryuji Sano, 2016. "Iterative Revelation Mechanisms," KIER Working Papers 937, Kyoto University, Institute of Economic Research.
    3. Rahul Deb & Debasis Mishra, 2013. "Implementation with Securities," Working Papers tecipa-484, University of Toronto, Department of Economics.
    4. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    5. Juan Carlos Carbajal & Andrew McLennan & Rabee Tourky, 2012. "Truthful Implementation and Preference Aggregation in Restricted Domains," Discussion Papers Series 459, School of Economics, University of Queensland, Australia.
    6. Rahul Deb & Debasis Mishra, 2014. "Implementation with contingent contracts," Discussion Papers 14-01, Indian Statistical Institute, Delhi.
    7. Mishra, Debasis & Pramanik, Anup & Roy, Souvik, 2014. "Multidimensional mechanism design in single peaked type spaces," Journal of Economic Theory, Elsevier, vol. 153(C), pages 103-116.
    8. Debasis Mishra & Anup Pramanik & Souvik Roy, 2013. "Implementation in multidimensional domains with ordinal restrictions," Discussion Papers 13-07, Indian Statistical Institute, Delhi.
    9. Ryuji Sano, 2021. "Dynamic communication mechanism design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 163-180, July.
    10. Sano, Ryuji, 2021. "Dynamic slot allocations with different patience levels," Games and Economic Behavior, Elsevier, vol. 130(C), pages 465-473.
    11. Mishra, Debasis & Pramanik, Anup & Roy, Souvik, 2016. "Local incentive compatibility with transfers," Games and Economic Behavior, Elsevier, vol. 100(C), pages 149-165.
    12. De, Parikshit & Mitra, Manipushpak, 2019. "Balanced implementability of sequencing rules," Games and Economic Behavior, Elsevier, vol. 118(C), pages 342-353.
    13. Nicolò, Antonio & Sen, Arunava & Yadav, Sonal, 2019. "Matching with partners and projects," Journal of Economic Theory, Elsevier, vol. 184(C).

  16. Debasis Mishra & Arunava Sen, 2010. "Roberts' theorem with neutrality: A Social welfare ordering approach," Discussion Papers 10-03, Indian Statistical Institute, Delhi.

    Cited by:

    1. Paul H. Edelman & John A Weymark, 2017. "Dominant Strategy Implementability, Zero Length Cycles, and Affine Maximizers," Vanderbilt University Department of Economics Working Papers 17-00002, Vanderbilt University Department of Economics.
    2. Nath, Swaprava & Sandholm, Tuomas, 2019. "Efficiency and budget balance in general quasi-linear domains," Games and Economic Behavior, Elsevier, vol. 113(C), pages 673-693.
    3. Quadir, Abdul, 2017. "Spanning tree auctions: A complete characterization," Mathematical Social Sciences, Elsevier, vol. 86(C), pages 1-8.
    4. Juan Carlos Carbajal & Andrew McLennan & Rabee Tourky, 2012. "Truthful Implementation and Preference Aggregation in Restricted Domains," Discussion Papers Series 459, School of Economics, University of Queensland, Australia.
    5. Mishra, Debasis & Nath, Swaprava & Roy, Souvik, 2018. "Separability and decomposition in mechanism design with transfers," Games and Economic Behavior, Elsevier, vol. 109(C), pages 240-261.
    6. Rahul Deb & Debasis Mishra, 2014. "Implementation with contingent contracts," Discussion Papers 14-01, Indian Statistical Institute, Delhi.
    7. Debasis Mishra & Abdul Quadir, 2012. "Deterministic single object auctions with private values," Discussion Papers 12-06, Indian Statistical Institute, Delhi.
    8. Kazuhiko Hashimoto & Kohei Shiozawa, 2016. "Strategy-Proof Probabilistic Mechanisms for Public Decision with Money," ISER Discussion Paper 0964, Institute of Social and Economic Research, Osaka University.
    9. Hitoshi Matsushima, 2018. "Optimal Deterministic Mechanism Design: Type‐Independent Preference Orderings," The Japanese Economic Review, Japanese Economic Association, vol. 69(4), pages 363-373, December.
    10. Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.
    11. De, Parikshit & Mitra, Manipushpak, 2019. "Balanced implementability of sequencing rules," Games and Economic Behavior, Elsevier, vol. 118(C), pages 342-353.
    12. Swaprava Nath & Nath and Arunava Sen, 2014. "Affine maximizers in domains with selfish valuations," Discussion Papers 14-12, Indian Statistical Institute, Delhi.
    13. Nakamura, Yuta, 2019. "Strategy-proof characterizations of the pivotal mechanisms on restricted domains," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 77-87.
    14. Debasis Mishra & Abdul Quadir, 2014. "Non-bossy single object auctions," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 93-110, April.

  17. Mishra, D. & Talman, A.J.J., 2010. "Characterization of the Walrasian equilibria of the assignment model," Other publications TiSEM 3e249b02-c0f4-4ccf-bd37-f, Tilburg University, School of Economics and Management.

    Cited by:

    1. Yuya Wakabayashi & Ryosuke Sakai & Shigehiro Serizawa, 2022. "A Characterization of the Minimum Price Walrasian Rule with Reserve Prices for an Arbitrary Number of Agents and Objects," ISER Discussion Paper 1161, Institute of Social and Economic Research, Osaka University.
    2. Zhou, Yu & Serizawa, Shigehiro, 2023. "Multi-object auction design beyond quasi-linearity: Leading examples," Games and Economic Behavior, Elsevier, vol. 140(C), pages 210-228.
    3. Yu Zhou & Shigehiro Serizawa, 2020. "Serial Vickrey Mechanism," ISER Discussion Paper 1095, Institute of Social and Economic Research, Osaka University.
    4. ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 18-2010, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    5. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    6. Andersson, Tommy & Andersson, Christer & Talman, Adolphus Johannes Jan, 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Working Papers 2010:15, Lund University, Department of Economics, revised 28 Jun 2012.
    7. Shuhei Morimoto & Shigehiro Serizawa, 2012. "Strategy-proofness and Efficiency with Nonquasi-linear Preferences: A Characterization of Minimum Price Walrasian Rule," ISER Discussion Paper 0852, Institute of Social and Economic Research, Osaka University.
    8. Pan, Lijun & Peng, Linyu & Zhou, Yu, 2020. "An assignment model with local constraints: Competitive equilibrium and ascending auction," Economics Letters, Elsevier, vol. 188(C).
    9. Andrew Caplin & John V. Leahy, 2010. "A Graph Theoretic Approach to Markets for Indivisible Goods," NBER Working Papers 16284, National Bureau of Economic Research, Inc.
    10. Yu Zhou & Shigehiro Serizawa, 2019. "Minimum price equilibrium in the assignment market," ISER Discussion Paper 1047, Institute of Social and Economic Research, Osaka University.
    11. van der Laan, G. & Talman, Dolf & Yang, Z., 2018. "Equilibrium in the Assignment Market under Budget Constraints," Other publications TiSEM 965cd6c8-4f09-47c4-a101-1, Tilburg University, School of Economics and Management.
    12. Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
    13. Andersson, Tommy & Svensson, Lars-Gunnar, 2012. "Non-Manipulable House Allocation with Rent Control," Working Papers 2012:18, Lund University, Department of Economics, revised 18 Sep 2013.
    14. Jiwoong Lee & Rudolf Müller & Dries Vermeulen, 2019. "Separating equilibrium in quasi-linear signaling games," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1033-1054, December.
    15. Andersson, Tommy & Gudmundsson, Jens & Talman, Adolphus & Yang, Zaifu, 2013. "A Competitive Partnership Formation Process," Working Papers 2013:2, Lund University, Department of Economics.
    16. Yokote, Koji, 2017. "Application of the discrete separation theorem to auctions," MPRA Paper 82884, University Library of Munich, Germany.
    17. Yu Zhou & Shigehiro Serizawa, 2016. "Strategy-Proofness and Efficiency for Non-quasi-linear Common-Tiered-Object Preferences: Characterization of Minimum Price Rule," ISER Discussion Paper 0971, Institute of Social and Economic Research, Osaka University.
    18. Solymosi, Tamás, 2023. "Sensitivity of fair prices in assignment markets," Mathematical Social Sciences, Elsevier, vol. 126(C), pages 1-12.
    19. Andersson, Tommy & Yang, Zaifu & Zhang, Dongmo, 2015. "How to efficiently allocate houses under price controls?," Economics Letters, Elsevier, vol. 130(C), pages 97-99.
    20. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    21. Sai, Seiken, 2014. "The structure of competitive equilibria in an assignment market," Journal of Mathematical Economics, Elsevier, vol. 51(C), pages 42-49.
    22. Zhou, Yu & Serizawa, Shigehiro, 2018. "Strategy-proofness and efficiency for non-quasi-linear and common-tiered-object preferences: Characterization of minimum price rule," Games and Economic Behavior, Elsevier, vol. 109(C), pages 327-363.
    23. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
    24. T. Andersson & C. Andersson & A. Talman, 2013. "Sets in excess demand in simple ascending auctions with unit-demand bidders," Annals of Operations Research, Springer, vol. 211(1), pages 27-36, December.
    25. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.

  18. Mishra, D. & Talman, A.J.J., 2010. "A characterization of the average tree solution for cycle-free graph games," Other publications TiSEM 6cab0e52-fe09-4428-8df6-0, Tilburg University, School of Economics and Management.

    Cited by:

    1. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Characterization of the Average Tree solution and its kernel," Post-Print halshs-01212115, HAL.
    2. Sylvain Béal & Aymeric Lardon & Éric Rémila & Philippe Solal, 2011. "The Average Tree Solution for Multi-Choice Forest Games," Post-Print halshs-00674431, HAL.
    3. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    4. René van den Brink, 2009. "Comparable Axiomatizations of the Myerson Value, the Restricted Banzhaf Value, Hierarchical Outcomes and the Average Tree Solution for Cycle-Free Graph Restricted Games," Tinbergen Institute Discussion Papers 09-108/1, Tinbergen Institute.
    5. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Other publications TiSEM d863606f-a58a-4f92-894d-e, Tilburg University, School of Economics and Management.
    6. Sylvain Béal & Eric Rémila & Philippe Solal, 2022. "Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 818-849, May.
    7. Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, Dolf & Zhang, Guang, 2023. "The two-step average tree value for graph and hypergraph games," Other publications TiSEM 8a5590f3-8b70-4202-95d9-2, Tilburg University, School of Economics and Management.
    8. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Average tree solutions and the distribution of Harsanyi dividends," MPRA Paper 17909, University Library of Munich, Germany.
    9. Khmelnitskaya, A. & van der Laan, G. & Talman, Dolf, 2016. "Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games," Other publications TiSEM f449b907-5e19-4702-b48e-a, Tilburg University, School of Economics and Management.
    10. Sylvain Béal & Éric Rémila & Philippe Solal, 2010. "Rooted-tree Solutions for Tree Games," Post-Print halshs-00530595, HAL.

  19. Debasis Mishra & Dolf Talman, 2009. "A Characterization of the average tree solution for tree games," Discussion Papers 09-08, Indian Statistical Institute, Delhi.

    Cited by:

    1. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Characterization of the Average Tree solution and its kernel," Post-Print halshs-01212115, HAL.
    2. Selçuk, Özer & Suzuki, Takamasa & Talman, Dolf, 2013. "Equivalence and axiomatization of solutions for cooperative games with circular communication structure," Economics Letters, Elsevier, vol. 121(3), pages 428-431.
    3. Sylvain Béal & Aymeric Lardon & Éric Rémila & Philippe Solal, 2011. "The Average Tree Solution for Multi-Choice Forest Games," Post-Print halshs-00674431, HAL.
    4. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    5. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Other publications TiSEM d863606f-a58a-4f92-894d-e, Tilburg University, School of Economics and Management.
    6. Mikel Álvarez-Mozos & Rene van den Brink & Gerard van der Laan & Oriol Tejada, 2015. "From Hierarchies to Levels: New Solutions for Games with Hierarchical Structure," CER-ETH Economics working paper series 15/215, CER-ETH - Center of Economic Research (CER-ETH) at ETH Zurich.
    7. Sylvain Béal & Eric Rémila & Philippe Solal, 2022. "Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 818-849, May.
    8. Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, Dolf & Zhang, Guang, 2023. "The two-step average tree value for graph and hypergraph games," Other publications TiSEM 8a5590f3-8b70-4202-95d9-2, Tilburg University, School of Economics and Management.
    9. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Average tree solutions and the distribution of Harsanyi dividends," MPRA Paper 17909, University Library of Munich, Germany.
    10. Koshevoy, G.A. & Talman, A.J.J., 2011. "Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025)," Other publications TiSEM adf30f3d-a79b-4105-9736-c, Tilburg University, School of Economics and Management.
    11. Khmelnitskaya, A. & van der Laan, G. & Talman, Dolf, 2016. "Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games," Other publications TiSEM f449b907-5e19-4702-b48e-a, Tilburg University, School of Economics and Management.
    12. Sylvain Béal & Éric Rémila & Philippe Solal, 2010. "Rooted-tree Solutions for Tree Games," Post-Print halshs-00530595, HAL.
    13. Özer Selçuk & Takamasa Suzuki, 2023. "Comparable axiomatizations of the average tree solution and the Myerson value," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 333-362, June.
    14. J. R. Fernández & I. Gallego & A. Jiménez-Losada & M. Ordóñez, 2019. "The cg-average tree value for games on cycle-free fuzzy communication structures," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(3), pages 456-478, October.

  20. Dinko Dimitrov & Thierry Marchant & Debasis Mishra, 2009. "Separability and aggregation of equivalence relations," Discussion Papers 09-06, Indian Statistical Institute, Delhi.

    Cited by:

    1. Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2013. "Unanimity overruled: Majority voting and the burden of history," Working Paper Series in Economics 50, Karlsruhe Institute of Technology (KIT), Department of Economics and Management.
    2. Maniquet, François & Mongin, Philippe, 2016. "A theorem on aggregating classifications," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 6-10.
    3. Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2013. "The Condorcet set: Majority voting over interconnected propositions," Working Paper Series in Economics 51, Karlsruhe Institute of Technology (KIT), Department of Economics and Management.
    4. Cho, Wonki Jo & Ju, Biung-Ghi, 2017. "Multinary group identification," Theoretical Economics, Econometric Society, vol. 12(2), May.
    5. Craven, John, 2024. "Aggregation of ranked categories," Mathematical Social Sciences, Elsevier, vol. 129(C), pages 27-33.
    6. Carlos Hervés-Beloso & Claudia Meo & Emma Moreno-García, 2014. "Information and size of coalitions," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 55(3), pages 545-563, April.
    7. Christopher Chambers & Alan Miller, 2011. "Rules for aggregating information," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 36(1), pages 75-82, January.
    8. Miller, Alan D., 2013. "Community standards," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2696-2705.
    9. Chambers, Christopher P. & Miller, Alan D., 2018. "Benchmarking," Theoretical Economics, Econometric Society, vol. 13(2), May.
    10. Miller, Alan D. & Chambers, Christopher P., "undated". "Scholarly Influence," Working Papers WP2013/1, University of Haifa, Department of Economics.

  21. Dutta, Bhaskar & Mishra, Debasis, 2009. "Minimum Cost Arborescences," The Warwick Economics Research Paper Series (TWERPS) 889, University of Warwick, Department of Economics.

    Cited by:

    1. Bergantiños, Gustavo & Vidal-Puga, Juan, 2016. "One-way and two-way cost allocation in hub network problems," MPRA Paper 74875, University Library of Munich, Germany.
    2. Hernández, Penélope & Peris, Josep E. & Vidal-Puga, Juan, 2023. "A non-cooperative approach to the folk rule in minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 922-928.
    3. Streekstra, Leanne & Trudeau, Christian, 2022. "Stable source connection and assignment problems as multi-period shortest path problems," Discussion Papers on Economics 8/2022, University of Southern Denmark, Department of Economics.
    4. Bahel, Eric & Gómez-Rúa, María & Vidal-Puga, Juan, 2024. "Stable and weakly additive cost sharing in shortest path problems," Journal of Mathematical Economics, Elsevier, vol. 110(C).
    5. Kusunoki, Yoshifumi & Tanino, Tetsuzo, 2017. "Investigation on irreducible cost vectors in minimum cost arborescence problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 214-221.
    6. Bergantiños, Gustavo & Martínez, Ricardo, 2014. "Cost allocation in asymmetric trees," European Journal of Operational Research, Elsevier, vol. 237(3), pages 975-987.
    7. Bahel, Eric, 2021. "Hyperadditive games and applications to networks or matching problems," Journal of Economic Theory, Elsevier, vol. 191(C).
    8. Eric Bahel & Christian Trudeau, 2018. "Stability and fairness in the job scheduling problem," Working Papers 1803, University of Windsor, Department of Economics.
    9. Ruben Juarez & Michael Wu, 2019. "Routing-Proofness in Congestion-Prone Networks," Games, MDPI, vol. 10(2), pages 1-18, April.
    10. Eric Bahel & Christian Trudeau, 2017. "Minimum incoming cost rules for arborescences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 287-314, August.
    11. Bahel, Eric & Gómez-Rúa, María & Vidal-Puga, Juan, 2020. "Stability in shortest path problems," MPRA Paper 98504, University Library of Munich, Germany.
    12. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    13. Hernández, Penélope & Peris, Josep E. & Silva-Reus, José A., 2012. "Strategic Sharing of a Costly Network," QM&ET Working Papers 12-10, University of Alicante, D. Quantitative Methods and Economic Theory.
    14. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.
    15. Eric Bahel & Christian Trudeau, 2016. "From spanning trees to arborescences: new and extended cost sharing solutions," Working Papers 1601, University of Windsor, Department of Economics.

  22. Heydenreich, B. & Mishra, D. & Müller, R.J. & Uetz, M.J., 2008. "Optimal mechanisms for single machine scheduling," Research Memorandum 033, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. 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.
    2. Ruben Hoeksma & Marc Uetz, 2016. "Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types," Operations Research, INFORMS, vol. 64(6), pages 1438-1450, December.

  23. Debasis Mishra & David C. Parkes, 2007. "Multi-item Vickrey-Dutch auctions," Discussion Papers 07-04, Indian Statistical Institute, Delhi.

    Cited by:

    1. Zhou, Yu & Serizawa, Shigehiro, 2023. "Multi-object auction design beyond quasi-linearity: Leading examples," Games and Economic Behavior, Elsevier, vol. 140(C), pages 210-228.
    2. Yu Zhou & Shigehiro Serizawa, 2020. "Serial Vickrey Mechanism," ISER Discussion Paper 1095, Institute of Social and Economic Research, Osaka University.
    3. ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 18-2010, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    4. Hikmet Gunay & Xin Meng, 2012. "Exposure Problem in Multi-unit Auctions," ISER Discussion Paper 0848, Institute of Social and Economic Research, Osaka University.
    5. Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2014. "Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis," Discussion Papers 14/27, Department of Economics, University of York.
    6. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
    7. Andersson, Tommy & Andersson, Christer & Talman, Adolphus Johannes Jan, 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Working Papers 2010:15, Lund University, Department of Economics, revised 28 Jun 2012.
    8. Laurent Lamy, 2012. "On minimal ascending auctions with payment discounts," Post-Print halshs-00754581, HAL.
    9. Yu Zhou & Shigehiro Serizawa, 2019. "Minimum price equilibrium in the assignment market," ISER Discussion Paper 1047, Institute of Social and Economic Research, Osaka University.
    10. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2015. "Transferring ownership of public housing to existing tenants: A mechanism design approach," Discussion Papers, Research Unit: Market Behavior SP II 2015-207, WZB Berlin Social Science Center.
    11. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    12. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    13. ANDERSSON, Tommy & EHLERS, Lars & LARS-GUNNAR, Svensson, 2014. "Transferring ownership of public housing to existing tenants: a mechanism design," Cahiers de recherche 2014-05, Universite de Montreal, Departement de sciences economiques.
    14. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    15. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
    16. Andersson, Tommy & Svensson, Lars-Gunnar, 2018. "Sequential rules for house allocation with price restrictions," Games and Economic Behavior, Elsevier, vol. 107(C), pages 41-59.
    17. Erlanson, Albin, 2011. "The Multi-item Bisection Auction," Working Papers 2011:31, Lund University, Department of Economics.
    18. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," PSE Working Papers halshs-00575076, HAL.
    19. Albin Erlanson, 2014. "The Duo-Item Bisection Auction," Computational Economics, Springer;Society for Computational Economics, vol. 43(1), pages 15-31, January.
    20. Akiyoshi Shioura, 2017. "On the Partnership formation problem," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 105-140, December.
    21. Tommy Andersson & Christer Andersson, 2012. "Properties of the DGS-Auction Algorithm," Computational Economics, Springer;Society for Computational Economics, vol. 39(2), pages 113-133, February.
    22. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," Working Papers halshs-00575076, HAL.
    23. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2016. "Transferring ownership of public housing to existing tenants: A market design approach," Journal of Economic Theory, Elsevier, vol. 165(C), pages 643-671.
    24. Daglish, Toby & Sağlam, Yiğit & Ho, Phuong, 2017. "Auctioning the Digital Dividend: A model for spectrum auctions," International Journal of Industrial Organization, Elsevier, vol. 53(C), pages 63-98.
    25. Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
    26. Cerezo Sánchez, David, 2017. "An Optimal ICO Mechanism," MPRA Paper 81285, University Library of Munich, Germany.
    27. Diksha Sinha & Roopali Sharma, 2024. "Future Research Prospects of Floriculture Industry from Management Perspective: A Bibliometric Analysis Using the SPAR-4-SLR Approach," South Asian Journal of Business and Management Cases, , vol. 13(1), pages 36-53, April.
    28. Omar Abbaas & Jose A. Ventura, 2024. "An Iterative Procurement Combinatorial Auction Mechanism for the Multi-Item, Multi-Sourcing Supplier-Selection and Order-Allocation Problem under a Flexible Bidding Language and Price-Sensitive Demand," Mathematics, MDPI, vol. 12(14), pages 1-30, July.
    29. Jorge Barrera & Alfredo Garcia, 2015. "Auction Design for the Efficient Allocation of Service Capacity Under Congestion," Operations Research, INFORMS, vol. 63(1), pages 151-165, February.

  24. Mishra, D. & Talman, A.J.J., 2006. "Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands," Discussion Paper 2006-84, Tilburg University, Center for Economic Research.

    Cited by:

    1. Gerard van der Laan & Zaifu Yang, 2011. "An Ascending Multi-Item Auction with Financially Constrained Bidders," Discussion Papers 11/04, Department of Economics, University of York.
    2. Eleni Batziou & Martin Bichler & Maximilian Fichtl, 2022. "Core-Stability in Assignment Markets with Financially Constrained Buyers," Papers 2205.06132, arXiv.org.

  25. MISHRA, Debasis & PARKES, David C., 2005. "Ascending price Vickrey auctions for general valuations," LIDAM Discussion Papers CORE 2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Vohra, Rakesh V., 2015. "Combinatorial Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    2. Andersson, Christer & Andersson, Ola & Andersson, Tommy, 2011. "Sealed Bid Auctions vs. Ascending Bid Auctions: An Experimental Study," Working Paper Series 882, Research Institute of Industrial Economics.
    3. Hitoshi Matsushima, 2015. "Connected Price Dynamics with Revealed Preferences and Auctioneer's Discretion in VCG Combinatorial Auction," CIRJE F-Series CIRJE-F-960, CIRJE, Faculty of Economics, University of Tokyo.
    4. Hitoshi Matsushima, 2011. "Price-Based Combinatorial Auction: Connectedness and Representative Valuations," CIRJE F-Series CIRJE-F-806, CIRJE, Faculty of Economics, University of Tokyo.
    5. Kominers, Scott Duke & Teytelboym, Alexander & Crawford, Vincent P, 2017. "An invitation to market design," University of California at San Diego, Economics Working Paper Series qt3xp2110t, Department of Economics, UC San Diego.
    6. Mishra, Debasis & Veeramani, Dharmaraj, 2007. "Vickrey-Dutch procurement auction for multiple items," European Journal of Operational Research, Elsevier, vol. 180(2), pages 617-629, July.
    7. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    8. Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
    9. Laurent Lamy, 2012. "On minimal ascending auctions with payment discounts," Post-Print halshs-00754581, HAL.
    10. Shuhei Morimoto & Shigehiro Serizawa, 2012. "Strategy-proofness and Efficiency with Nonquasi-linear Preferences: A Characterization of Minimum Price Walrasian Rule," ISER Discussion Paper 0852, Institute of Social and Economic Research, Osaka University.
    11. Ayman Chouayakh & Aurélien Bechler & Isabel Amigo & Loutfi Nuaymi & Patrick Maillé, 2021. "A truthful ascending auction mechanism for dynamic allocation of LSA spectrum blocks," Netnomics, Springer, vol. 22(1), pages 27-52, June.
    12. Ryuji Sano, 2016. "Iterative Revelation Mechanisms," KIER Working Papers 937, Kyoto University, Institute of Economic Research.
    13. Hitoshi Matsushima, 2015. "Connected Price Dynamics with Revealed Preferences and Auctioneer’s Discretionin VCG Combinatorial Auction (Published in the B. E. Journal of Theoretical Economics 18 (1), 2018.)," CARF F-Series CARF-F-359, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    14. Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
    15. Laurent Lamy, 2007. "The Ausubel-Milgrom Proxy Auction with Final Discounts," Working Papers 2007-25, Center for Research in Economics and Statistics.
    16. Mishra, D. & Talman, A.J.J., 2006. "Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands," Other publications TiSEM ffa225a4-3180-4f9a-993c-3, Tilburg University, School of Economics and Management.
    17. Martin Bichler & Pasha Shabalin & Alexander Pikovsky, 2009. "A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats," Information Systems Research, INFORMS, vol. 20(1), pages 33-59, March.
    18. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
    19. Martin Bichler & Pasha Shabalin & Georg Ziegler, 2013. "Efficiency with Linear Prices? A Game-Theoretical and Computational Analysis of the Combinatorial Clock Auction," Information Systems Research, INFORMS, vol. 24(2), pages 394-417, June.
    20. Akiyoshi Shioura & Zaifu Yang, 2013. "Equilibrium, Auction, Multiple Substitutes and Complements," Discussion Papers 13/17, Department of Economics, University of York.
    21. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    22. Ryuji Sano, 2021. "Dynamic communication mechanism design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 163-180, July.
    23. Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.
    24. Mochon, A. & Saez, Y. & Gomez-Barroso, J.L. & Isasi, P., 2012. "Exploring pricing rules in combinatorial sealed-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 82(2), pages 462-478.
    25. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    26. Zaifu Yang & Jingsheng Yu, 2018. "Efficient Ascending Menu Auctions with Budget Constrained Bidders," Discussion Papers 18/09, Department of Economics, University of York.
    27. Andersson, Tommy & Svensson, Lars-Gunnar, 2018. "Sequential rules for house allocation with price restrictions," Games and Economic Behavior, Elsevier, vol. 107(C), pages 41-59.
    28. Shirata, Yasuhiro, 2013. "First Price Package Auction with Many Traders," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/5134, Otaru University of Commerce.
    29. Michael H. Rothkopf, 2007. "Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical," Operations Research, INFORMS, vol. 55(2), pages 191-197, April.
    30. Tomoya Kazumura & Shigehiro Serizawa, 2016. "Efficiency and strategy-proofness in object assignment problems with multi-demand preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
    31. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," PSE Working Papers halshs-00575076, HAL.
    32. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
    33. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2005. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Levine's Bibliography 784828000000000133, UCLA Department of Economics.
    34. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions II: Ascending Auctions," Discussion Paper Series dp382, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    35. Christer Andersson & Ola Andersson & Tommy Andersson, 2013. "Sealed bid auctions versus ascending bid auctions: an experimental study," Review of Economic Design, Springer;Society for Economic Design, vol. 17(1), pages 1-16, March.
    36. Laurent Lamy, 2007. "Contingent Auctions with Allocative Externalities : Vickrey Versus the Ausubel-Milgrom Proxy Auction," Working Papers 2007-26, Center for Research in Economics and Statistics.
    37. Laurent Lamy, 2007. "Contingent Auctions with Allocative Externalities: Vickrey vs. the Ausubel-Milgrom Proxy Auction," 2007 Meeting Papers 427, Society for Economic Dynamics.
    38. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," Working Papers halshs-00575076, HAL.
    39. Schneider, S. & Shabalin, P. & Bichler, M., 2010. "On the robustness of non-linear personalized price combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 206(1), pages 248-259, October.
    40. Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
    41. Xu, Su Xiu & Cheng, Meng & Huang, George Q., 2015. "Efficient intermodal transportation auctions for B2B e-commerce logistics with transaction costs," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 322-337.
    42. Eleni Batziou & Martin Bichler & Maximilian Fichtl, 2022. "Core-Stability in Assignment Markets with Financially Constrained Buyers," Papers 2205.06132, arXiv.org.
    43. Ioannis Petrakis & Georg Ziegler & Martin Bichler, 2013. "Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules," Information Systems Research, INFORMS, vol. 24(3), pages 768-786, September.
    44. Chen, Yan & Takeuchi, Kan, 2010. "Multi-object auctions with package bidding: An experimental comparison of Vickrey and iBEA," Games and Economic Behavior, Elsevier, vol. 68(2), pages 557-579, March.
    45. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
    46. Sano, Ryuji, 2011. "Incentives in core-selecting auctions with single-minded bidders," Games and Economic Behavior, Elsevier, vol. 72(2), pages 602-606, June.
    47. Lavi, Ron & Oren, Sigal, 2012. "Side-communication yields efficiency of ascending auctions: The two-items case," Games and Economic Behavior, Elsevier, vol. 76(2), pages 439-456.
    48. Hitoshi Matsushima, 2010. "Auctioneer's Discretion in Combinatorial Auctions," CARF F-Series CARF-F-293, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo, revised Sep 2012.
    49. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
    50. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.
    51. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.

  26. MISHRA, Debasis & RANGARAJAN, Bharath, 2005. "Cost sharing in a job scheduling problem," LIDAM Discussion Papers CORE 2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Yuan Ju & Youngsub Chun & Rene van den Brink, 2014. "Auctioning and Selling Positions: a noncooperative approach to queueing conflicts," Working Paper Series no91, Institute of Economic Research, Seoul National University.
    2. Cheng‐Kuang Wu & Yi‐Ming Chen & Dachrahn Wu & Ching‐Lin Chi, 2020. "A Game Theory Approach for Assessment of Risk and Deployment of Police Patrols in Response to Criminal Activity in San Francisco," Risk Analysis, John Wiley & Sons, vol. 40(3), pages 534-549, March.
    3. Alex Gershkov & Paul Schweinzer, 2010. "When queueing is better than push and shove," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 409-430, July.
    4. 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.
    5. Rene van den Brink & Youngsub Chun, 2010. "Balanced Consistency and Balanced Cost Reduction for Sequencing Problems," Tinbergen Institute Discussion Papers 10-035/1, Tinbergen Institute.
    6. Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics.
    7. Banerjee, Sreoshi, 2023. "Stability and fairness in sequencing games: optimistic approach and pessimistic scenarios," MPRA Paper 118680, University Library of Munich, Germany.
    8. MISHRA, Debasis & RANGARAJAN, Bharath, 2005. "Cost sharing in a job scheduling problem," LIDAM Discussion Papers CORE 2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
    10. Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.
    11. Andreas S. Schulz & Nelson A. Uhan, 2010. "Sharing Supermodular Costs," Operations Research, INFORMS, vol. 58(4-part-2), pages 1051-1056, August.
    12. Demetrescu, Camil & Lupia, Francesco & Mendicelli, Angelo & Ribichini, Andrea & Scarcello, Francesco & Schaerf, Marco, 2019. "On the Shapley value and its application to the Italian VQR research assessment exercise," Journal of Informetrics, Elsevier, vol. 13(1), pages 87-104.

  27. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, "undated". "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," ISER Discussion Paper 1001r, Institute of Social and Economic Research, Osaka University, revised Jan 2020.

    Cited by:

    1. Yuya Wakabayashi & Ryosuke Sakai & Shigehiro Serizawa, 2022. "A Characterization of the Minimum Price Walrasian Rule with Reserve Prices for an Arbitrary Number of Agents and Objects," ISER Discussion Paper 1161, Institute of Social and Economic Research, Osaka University.
    2. Ryosuke Sakai & Shigehiro Serizawa, 2023. "Strategy-proof mechanism design with non-quasi-linear preferences: ex-post revenue maximization for an arbitrary number of objects," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 103-120, January.
    3. Zhou, Yu & Serizawa, Shigehiro, 2023. "Multi-object auction design beyond quasi-linearity: Leading examples," Games and Economic Behavior, Elsevier, vol. 140(C), pages 210-228.
    4. Yu Zhou & Shigehiro Serizawa, 2020. "Serial Vickrey Mechanism," ISER Discussion Paper 1095, Institute of Social and Economic Research, Osaka University.
    5. Bando, Keisuke & Kawasaki, Ryo, 2021. "Stability properties of the core in a generalized assignment problem," Games and Economic Behavior, Elsevier, vol. 130(C), pages 211-223.
    6. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    7. Hiroki Shinozaki, 2022. "Egalitarian-Equivalence and Strategy-Proofness in the Object Allocation Problem with Non-Quasi-Linear Preferences," Games, MDPI, vol. 13(6), pages 1-24, November.
    8. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    9. Mridu Prabal Goswami, 2024. "Strategy-proof Selling: a Geometric Approach," Papers 2406.12279, arXiv.org, revised Jul 2024.
    10. Malik, Komal & Mishra, Debasis, 2021. "Pareto efficient combinatorial auctions: Dichotomous preferences without quasilinearity," Journal of Economic Theory, Elsevier, vol. 191(C).
    11. Di Feng, 2023. "Efficiency in Multiple-Type Housing Markets," Papers 2308.14989, arXiv.org, revised Dec 2023.

Articles

  1. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    See citations under working paper version above.
  2. Ehlers, Lars & Majumdar, Dipjyoti & Mishra, Debasis & Sen, Arunava, 2020. "Continuity and incentive compatibility in cardinal mechanisms," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 31-41.

    Cited by:

    1. Brandt, Felix & Lederer, Patrick, 2023. "Characterizing the top cycle via strategyproofness," Theoretical Economics, Econometric Society, vol. 18(2), May.
    2. Kikuchi, Kazuya & Koriyama, Yukio, 2023. "The winner-take-all dilemma," Theoretical Economics, Econometric Society, vol. 18(3), July.
    3. Núñez, Matías & Pimienta, Carlos & Xefteris, Dimitrios, 2022. "On the implementation of the median," Journal of Mathematical Economics, Elsevier, vol. 99(C).

  3. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    See citations under working paper version above.
  4. Debasis Mishra & Tridib Sharma, 2018. "A simple budget-balanced mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 147-170, January.

    Cited by:

    1. Nath, Swaprava & Sandholm, Tuomas, 2019. "Efficiency and budget balance in general quasi-linear domains," Games and Economic Behavior, Elsevier, vol. 113(C), pages 673-693.
    2. Vikram, Aditya, 2022. "A top-only mechanism with reserve price for single-good allocation problem," Economics Letters, Elsevier, vol. 217(C).

  5. Long, Yan & Mishra, Debasis & Sharma, Tridib, 2017. "Balanced ranking mechanisms," Games and Economic Behavior, Elsevier, vol. 105(C), pages 9-39.
    See citations under working paper version above.
  6. Mishra, Debasis, 2016. "Ordinal Bayesian incentive compatibility in restricted domains," Journal of Economic Theory, Elsevier, vol. 163(C), pages 925-954.
    See citations under working paper version above.
  7. Mishra, Debasis & Pramanik, Anup & Roy, Souvik, 2016. "Local incentive compatibility with transfers," Games and Economic Behavior, Elsevier, vol. 100(C), pages 149-165.
    See citations under working paper version above.
  8. Thierry Marchant & Debasis Mishra, 2015. "Mechanism design with two alternatives in quasi-linear environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 433-455, February.
    See citations under working paper version above.
  9. Mishra, Debasis & Pramanik, Anup & Roy, Souvik, 2014. "Multidimensional mechanism design in single peaked type spaces," Journal of Economic Theory, Elsevier, vol. 153(C), pages 103-116.

    Cited by:

    1. André Berger & Rudolf Müller & Seyed Hossein Naeemi, 2017. "Characterizing implementable allocation rules in multi-dimensional environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 367-383, February.
    2. Paul H. Edelman & John A Weymark, 2017. "Dominant Strategy Implementability, Zero Length Cycles, and Affine Maximizers," Vanderbilt University Department of Economics Working Papers 17-00002, Vanderbilt University Department of Economics.
    3. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    4. Kumar, Ujjwal & Roy, Souvik, 2024. "Local incentive compatibility on gross substitutes and other non-convex type-spaces," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    5. Paul H. Edelman & John A. Weymark, 2021. "Dominant strategy implementability and zero length cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(4), pages 1091-1120, November.
    6. Carbajal, Juan Carlos & Müller, Rudolf, 2017. "Monotonicity and revenue equivalence domains by monotonic transformations in differences," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 29-35.
    7. Mishra, Debasis & Pramanik, Anup & Roy, Souvik, 2016. "Local incentive compatibility with transfers," Games and Economic Behavior, Elsevier, vol. 100(C), pages 149-165.
    8. Kumar, Ujjwal & Roy, Souvik, 2021. "Local incentive compatibility in ordinal type-spaces," MPRA Paper 110994, University Library of Munich, Germany.
    9. Alexey Kushnir & Shuo Liu, 2019. "On the equivalence of Bayesian and dominant strategy implementation for environments with nonlinear utilities," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 67(3), pages 617-644, April.
    10. Juan Carlos Carbajal & Rudolf Müller, 2015. "Implementability under Monotonic Transformations in Differences," Working Papers 37, Peruvian Economic Association.

  10. Rahul Deb & Debasis Mishra, 2014. "Implementation With Contingent Contracts," Econometrica, Econometric Society, vol. 82, pages 2371-2393, November.
    See citations under working paper version above.
  11. Debasis Mishra & Abdul Quadir, 2014. "Non-bossy single object auctions," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 93-110, April.

    Cited by:

    1. Conan Mukherjee, 2020. "On group strategyproof and optimal object allocation," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(2), pages 289-304, October.
    2. William Thomson, 2014. "Non-bossiness," RCER Working Papers 586, University of Rochester - Center for Economic Research (RCER).
    3. Mishra, Debasis & Nath, Swaprava & Roy, Souvik, 2018. "Separability and decomposition in mechanism design with transfers," Games and Economic Behavior, Elsevier, vol. 109(C), pages 240-261.
    4. Hitoshi Matsushima, 2018. "Optimal Deterministic Mechanism Design: Type‐Independent Preference Orderings," The Japanese Economic Review, Japanese Economic Association, vol. 69(4), pages 363-373, December.
    5. De, Parikshit & Mitra, Manipushpak, 2019. "Balanced implementability of sequencing rules," Games and Economic Behavior, Elsevier, vol. 118(C), pages 342-353.
    6. Thierry Marchant & Debasis Mishra, 2015. "Mechanism design with two alternatives in quasi-linear environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 433-455, February.
    7. Swaprava Nath & Nath and Arunava Sen, 2014. "Affine maximizers in domains with selfish valuations," Discussion Papers 14-12, Indian Statistical Institute, Delhi.
    8. Mukherjee, Conan, 2015. "On Axioms Underlying Use of Reserve Price," Working Papers 2015:7, Lund University, Department of Economics, revised 14 Apr 2015.

  12. , & ,, 2013. "Implementation in multidimensional dichotomous domains," Theoretical Economics, Econometric Society, vol. 8(2), May.
    See citations under working paper version above.
  13. Mishra, Debasis & Roy, Souvik, 2012. "Strategy-proof partitioning," Games and Economic Behavior, Elsevier, vol. 76(1), pages 285-300.
    See citations under working paper version above.
  14. Mishra, Debasis & Sen, Arunava, 2012. "Robertsʼ Theorem with neutrality: A social welfare ordering approach," Games and Economic Behavior, Elsevier, vol. 75(1), pages 283-298.
    See citations under working paper version above.
  15. Dinko Dimitrov & Thierry Marchant & Debasis Mishra, 2012. "Separability and aggregation of equivalence relations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(1), pages 191-212, September.
    See citations under working paper version above.
  16. Dutta, Bhaskar & Mishra, Debasis, 2012. "Minimum cost arborescences," Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
    See citations under working paper version above.
  17. Debasis Mishra & A. Talman, 2010. "A characterization of the average tree solution for tree games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 105-111, March.
    See citations under working paper version above.
  18. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
    See citations under working paper version above.
  19. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
    See citations under working paper version above.
  20. R.P. Mohanty & D. Mishra & T. Mishra, 2009. "Comparative study of production outsourcing models," Journal of Advances in Management Research, Emerald Group Publishing Limited, vol. 6(1), pages 41-69, April.

    Cited by:

    1. Luigi Cantone & Pierpaolo Testa & Svend Hollensen & Giuseppe Fabio Cantone, 2019. "Outsourcing New Product Development Fostered By Disruptive Technological Innovation: A Decision-Making Model," International Journal of Innovation Management (ijim), World Scientific Publishing Co. Pte. Ltd., vol. 23(01), pages 1-45, January.
    2. Machado, Mariana Paim & Abreu, Jaqueline Lilge & Morandi, Maria Isabel Motta & Piran, Fabio Sartori & Lacerda, Daniel Pacheco, 2023. "Exploratory decision robustness analysis of the theory of constraints focusing process using system dynamics modeling," International Journal of Production Economics, Elsevier, vol. 260(C).

  21. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    See citations under working paper version above.
  22. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(3), pages 369-382, October.
    See citations under working paper version above.
  23. Mishra, Debasis & Veeramani, Dharmaraj, 2007. "Vickrey-Dutch procurement auction for multiple items," European Journal of Operational Research, Elsevier, vol. 180(2), pages 617-629, July.

    Cited by:

    1. Fuqiang Lu & Yanli Hu & Hualing Bi & Min Huang & Meng Zhao, 2018. "An Auction Approach for Cost and Schedule Management of IT Outsourcing Project," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-23, October.
    2. Grigorieva, E. & Herings, P.J.J. & Müller, R.J. & Vermeulen, A.J., 2009. "Fraction auctions: the tradeoff between efficiency and running time," Research Memorandum 045, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. Kokott, Gian-Marco & Bichler, Martin & Paulsen, Per, 2019. "The beauty of Dutch: Ex-post split-award auctions in procurement markets with diseconomies of scale," European Journal of Operational Research, Elsevier, vol. 278(1), pages 202-210.
    4. Jie, Yingmo & Liu, Charles Zhechao & Choo, Kim-Kwang Raymond & Guo, Cheng, 2024. "An incentive compatible ZD strategy-based data sharing model for federated learning: A perspective of iterated prisoner's dilemma," European Journal of Operational Research, Elsevier, vol. 315(2), pages 764-776.
    5. Li, Yung-Ming & Jhang-Li, Jhih-Hua, 2011. "Analyzing online B2B exchange markets: Asymmetric cost and incomplete information," European Journal of Operational Research, Elsevier, vol. 214(3), pages 722-731, November.
    6. Mansouri, Bahareh & Hassini, Elkafi, 2015. "A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions," European Journal of Operational Research, Elsevier, vol. 244(2), pages 565-575.
    7. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.

  24. Mishra, Debasis & Garg, Rahul, 2006. "Descending price multi-item auctions," Journal of Mathematical Economics, Elsevier, vol. 42(2), pages 161-179, April.

    Cited by:

    1. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    2. Wilfred Amaldoss & Sanjay Jain, 2008. "Joint Bidding in the Name-Your-Own-Price Channel: A Strategic Analysis," Management Science, INFORMS, vol. 54(10), pages 1685-1699, October.
    3. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.