default search action
Debasis Mishra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Rasmita Sahu, Hrudananda Pradhan, Biswa Binayak Mangaraj, Debasis Mishra:
Compact wide dual-band square dielectric resonator antenna to serve X-band/emerging 5G communication. Microelectron. J. 151: 106328 (2024) - 2022
- [j22]Sushil Bikhchandani, Debasis Mishra:
Selling two identical objects. J. Econ. Theory 200: 105397 (2022) - [i8]Debasis Mishra, Kolagani Paramahamsa:
Selling to a principal and a budget-constrained agent. CoRR abs/2202.10378 (2022) - [i7]Sushil Bikhchandani, Debasis Mishra:
Rank-Preserving Multidimensional Mechanisms. CoRR abs/2209.10137 (2022) - 2021
- [j21]Komal Malik, Debasis Mishra:
Pareto efficient combinatorial auctions: Dichotomous preferences without quasilinearity. J. Econ. Theory 191: 105128 (2021) - 2020
- [j20]Tomoya Kazumura, Debasis Mishra, Shigehiro Serizawa:
Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences. J. Econ. Theory 188: 105036 (2020) - [j19]Ribhu Abhusan Panda, Debasis Mishra:
Efficient Design of Bi-circular Patch Antenna for 5G Communication with Mathematical Calculations for Resonant Frequencies. Wirel. Pers. Commun. 112(2): 717-727 (2020) - [i6]Sushil Bikhchandani, Debasis Mishra:
Selling Two Identical Objects. CoRR abs/2009.11545 (2020) - [i5]Komal Malik, Debasis Mishra:
Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity. CoRR abs/2009.12114 (2020) - [i4]Sulagna Dasgupta, Debasis Mishra:
Ordinal Bayesian incentive compatibility in random assignment model. CoRR abs/2009.13104 (2020)
2010 – 2019
- 2019
- [c6]Ribhu Abhusan Panda, Priya Kumari, Janhabi Naik, Priyanka Negi, Debasis Mishra:
Flower Shaped Patch with Circular Defective Ground Structure for 15 GHz Application. IBICA 2019: 243-249 - [c5]Ribhu Abhusan Panda, Madhusmita Kuldeep, Varanasi Swatishree, Gudla Sruthi, Udit Narayan Mohapatro, Pawan Kumar Nayak, Debasis Mishra:
2-Element Pentagon Patch Array for 25 GHz Applications. IBICA 2019: 317-322 - 2018
- [j18]Thierry Marchant, Debasis Mishra:
The characterization of affine maximizers on restricted domains with two alternatives. Eur. J. Oper. Res. 266(3): 1038-1043 (2018) - [j17]Debasis Mishra, Swaprava Nath, Souvik Roy:
Separability and decomposition in mechanism design with transfers. Games Econ. Behav. 109: 240-261 (2018) - [j16]Debasis Mishra, Tridib Sharma:
A simple budget-balanced mechanism. Soc. Choice Welf. 50(1): 147-170 (2018) - 2017
- [j15]Yan Long, Debasis Mishra, Tridib Sharma:
Balanced ranking mechanisms. Games Econ. Behav. 105: 9-39 (2017) - 2016
- [j14]Debasis Mishra, Anup Pramanik, Souvik Roy:
Local incentive compatibility with transfers. Games Econ. Behav. 100: 149-165 (2016) - [j13]Debasis Mishra:
Ordinal Bayesian incentive compatibility in restricted domains. J. Econ. Theory 163: 925-954 (2016) - [i3]Debasis Mishra, Tridib Sharma:
Balanced Ranking Mechanisms. CoRR abs/1604.08379 (2016) - 2015
- [j12]Jelle Duives, Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz:
On optimal mechanism design for a sequencing problem. J. Sched. 18(1): 45-59 (2015) - [j11]Thierry Marchant, Debasis Mishra:
Mechanism design with two alternatives in quasi-linear environments. Soc. Choice Welf. 44(2): 433-455 (2015) - 2014
- [j10]Debasis Mishra, Anup Pramanik, Souvik Roy:
Multidimensional mechanism design in single peaked type spaces. J. Econ. Theory 153: 103-116 (2014) - 2012
- [j9]Bhaskar Dutta, Debasis Mishra:
Minimum cost arborescences. Games Econ. Behav. 74(1): 120-143 (2012) - [j8]Debasis Mishra, Arunava Sen:
Roberts' Theorem with neutrality: A social welfare ordering approach. Games Econ. Behav. 75(1): 283-298 (2012) - [j7]Debasis Mishra, Souvik Roy:
Strategy-proof partitioning. Games Econ. Behav. 76(1): 285-300 (2012) - 2010
- [j6]Debasis Mishra, A. J. J. Talman:
A characterization of the average tree solution for tree games. Int. J. Game Theory 39(1-2): 105-111 (2010) - [i2]Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz:
Optimal Mechanisms for Scheduling. Scheduling 2010 - [i1]Debasis Mishra, Arunava Sen:
Roberts' Theorem with Neutrality: A Social Welfare Ordering Approach. CoRR abs/1003.1550 (2010)
2000 – 2009
- 2009
- [j5]Debasis Mishra, David C. Parkes:
Multi-item Vickrey-Dutch auctions. Games Econ. Behav. 66(1): 326-347 (2009) - 2008
- [c4]Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz:
Optimal Mechanisms for Single Machine Scheduling. WINE 2008: 414-425 - 2007
- [j4]Debasis Mishra, Dharmaraj Veeramani:
Vickrey-Dutch procurement auction for multiple items. Eur. J. Oper. Res. 180(2): 617-629 (2007) - [j3]Debasis Mishra, David C. Parkes:
Ascending price Vickrey auctions for general valuations. J. Econ. Theory 132(1): 335-366 (2007) - [j2]Debasis Mishra, Bharath Rangarajan:
Cost sharing in a job scheduling problem. Soc. Choice Welf. 29(3): 369-382 (2007) - 2005
- [j1]Debasis Mishra, Sunil S. Reddy, Dharmaraj Veeramani:
Performance Evaluation of Multi-Object Auctions. Electron. Commer. Res. 5(2): 293-307 (2005) - [c3]Debasis Mishra, Bharath Rangarajan:
Cost sharing in a job scheduling problem using the Shapley value. EC 2005: 232-239 - 2004
- [c2]Debasis Mishra:
Simple primal-dual auctions are not possible. EC 2004: 250-251 - 2002
- [c1]Debasis Mishra, Dharmaraj Veeramani:
A Multi-Attribute Reverse Auction for Outsourcing. DEXA Workshops 2002: 675-679
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint