Access Statistics for Debasis Mishra

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Characterization of the Average Tree Solution for Cycle-Free Graph Games 0 0 0 0 0 4 6 9
A Characterization of the Average Tree Solution for Cycle-Free Graph Games 0 0 0 1 0 5 6 27
A Characterization of the average tree solution for tree games 0 0 0 0 1 7 10 17
A Foundation for Dominant Strategy Voting Mechanisms 0 0 0 29 0 3 8 35
A Foundation for dominant strategy voting mechanisms 0 0 0 1 0 5 5 18
A characterization of the average tree solution for cycle-free graph games 0 0 0 1 0 1 2 17
Ascending price Vickrey auctions for general valuations 0 0 0 30 1 9 11 193
Balanced ranking mechanisms 0 0 0 2 2 3 4 37
Characterization of the Walrasian equilibria of the assignment model 0 0 1 2 0 2 7 27
Characterization of the walrasian equilibria of the assignment model 0 0 0 1 0 6 10 17
Continuity and Incentive Compatibility in Cardinal Voting Mechanisms 0 0 0 26 1 7 10 73
Continuity and incentive compatibility 0 0 0 16 1 4 6 44
Cost sharing in a job scheduling problem 0 0 0 40 0 4 7 194
Deterministic single object auctions with private values 0 0 0 3 2 10 19 28
Implementation in multidimensional dichotomous domains 0 0 0 3 1 8 8 25
Implementation in multidimensional domains with ordinal restrictions 0 0 0 5 1 5 7 23
Implementation with Securities 1 1 2 27 2 3 6 114
Implementation with contingent contracts 0 0 0 3 1 20 20 51
Implementation with securities 0 0 0 1 0 2 3 13
Local incentive compatibility with transfers 0 0 0 3 0 6 8 25
Mechanism design for multiple item procurement using a distributed ellipsoid algorithm 0 0 0 11 0 3 3 74
Mechanism design with two alternatives in Quasi-linear environment 0 0 0 2 0 11 16 26
Mechanism design without quasilinearity 0 0 1 3 2 6 8 25
Mechanism design without quasilinearity 0 0 0 65 10 18 20 120
Minimum Cost Arborescences 0 0 0 39 6 12 12 218
Minimum Cost Arborescences 0 0 0 1 1 7 11 31
Minimum cost arborescences 0 0 0 1 5 12 12 21
Multi-item Vickrey-Dutch auctions 0 0 0 1 6 12 18 26
Optimal mechanisms for single machine scheduling 0 0 0 37 3 5 7 121
Ordinal Bayesian incentive compatibility in random assignment model 0 0 0 9 2 6 9 34
Ordinal Bayesian incentive compatibility in random assignment model 0 0 1 26 1 10 13 113
Ordinal Bayesian incentive compatibility in restricted domains 0 0 1 2 0 4 9 26
Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands 0 0 0 5 0 5 6 134
Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands 0 0 0 1 1 3 3 9
Overdemand and underdemand in economies with indivisible goods and unit demand 0 0 0 2 1 9 12 46
Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity 0 0 0 7 0 3 7 31
Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity 0 0 1 15 0 3 9 32
Roberts' theorem with neutrality: A Social welfare ordering approach 0 0 0 2 1 9 10 19
Selling Two Identical Objects 0 0 0 23 3 14 18 90
Selling Two Identical Objects 0 0 1 16 4 7 13 39
Selling to a naive agent with two rationales 0 0 0 12 0 5 9 51
Separability and aggregation of equivalence relations 0 0 0 1 0 8 9 15
Strategy-proof multi-object allocation: Ex-post revenue maximization with no wastage 0 0 0 12 1 29 34 73
Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage 0 0 0 2 2 4 6 21
Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences 0 0 0 15 9 17 19 45
Strategy-proof partitioning 0 0 0 1 1 4 7 15
Total Working Papers 1 1 8 505 72 340 463 2,442
18 registered items for which data could not be found

Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A characterization of the average tree solution for tree games 0 0 0 12 11 34 38 91
A simple budget-balanced mechanism 0 0 0 3 1 14 18 56
Ascending price Vickrey auctions for general valuations 0 0 1 43 3 9 11 176
Balanced ranking mechanisms 0 0 0 5 0 13 21 166
Characterization of the Walrasian equilibria of the assignment model 0 0 2 43 1 4 10 155
Comparative study of production outsourcing models 0 0 0 1 0 0 2 12
Continuity and incentive compatibility in cardinal mechanisms 0 0 1 11 3 8 13 60
Cost sharing in a job scheduling problem 0 0 0 18 1 6 9 137
Descending price multi-item auctions 0 0 0 39 0 1 2 394
Implementation With Contingent Contracts 0 0 0 3 1 4 4 64
Implementation in multidimensional dichotomous domains 0 0 0 10 0 5 9 149
Local incentive compatibility with transfers 0 0 1 2 2 5 9 40
Mechanism design and incentive compatibility 0 0 0 21 0 2 3 78
Mechanism design with two alternatives in quasi-linear environments 0 0 0 4 0 5 7 47
Mechanism design without quasilinearity 0 0 1 7 1 8 12 84
Minimum cost arborescences 0 0 0 14 2 6 11 67
Multi-item Vickrey-Dutch auctions 0 0 0 38 1 8 13 168
Multidimensional mechanism design in single peaked type spaces 0 0 1 15 0 2 5 71
Non-bossy single object auctions 0 0 0 4 0 1 3 24
Ordinal Bayesian incentive compatibility in restricted domains 0 0 0 11 1 7 10 59
Robertsʼ Theorem with neutrality: A social welfare ordering approach 0 0 0 13 0 5 6 72
Separability and aggregation of equivalence relations 0 0 0 3 0 4 7 56
Separability and decomposition in mechanism design with transfers 0 0 1 2 1 5 7 48
Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences 0 0 0 3 3 10 16 56
Strategy-proof partitioning 0 0 0 3 0 6 7 46
The characterization of affine maximizers on restricted domains with two alternatives 0 0 0 0 1 6 7 20
Vickrey-Dutch procurement auction for multiple items 0 0 0 16 0 4 7 78
Total Journal Articles 0 0 8 344 33 182 267 2,474

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage statistics for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Since October 2025, abstract view statistics are potentially heavily influenced by traffic from AI bots and tools that we could not eliminate despite our best efforts.

Statistics updated 2026-03-04