default search action
Mithun Chakraborty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Mithun Chakraborty
, Erel Segal-Halevi
Weighted Fairness Notions for Indivisible Items Revisited. ACM Trans. Economics and Comput. 12(3): 9:1-9:45 (2024) - [c20]Chris Mascioli
A Financial Market Simulation Environment for Trading Agents Using Deep Reinforcement Learning. ICAIF 2024: 117-125 - [c19]Anri Gu
The Effect of Liquidity on the Spoofability of Financial Markets. ICAIF 2024: 239-247 - 2023
- [j10]Mithun Chakraborty, Debdatta Kandar, Bansibadan Maji
Integrated radar radio: enabling technology for smart vehicle of smart cities. Int. J. Auton. Adapt. Commun. Syst. 16(4): 391-403 (2023) - [i16]Christine Konicki, Mithun Chakraborty, Michael P. Wellman
Exploiting Extensive-Form Structure in Empirical Game-Theoretic Analysis. CoRR abs/2302.01366 (2023) - 2022
- [c18]Mithun Chakraborty, Erel Segal-Halevi, Warut Suksompong:
Weighted Fairness Notions for Indivisible Items Revisited. AAAI 2022: 4949-4956 - [c17]Zun Li, Feiran Jia, Aditya Mate, Shahin Jabbari, Mithun Chakraborty, Milind Tambe, Yevgeniy Vorobeychik:
Solving structured hierarchical games using differential backward induction. UAI 2022: 1107-1117 - [c16]Christine Konicki, Mithun Chakraborty
Exploiting Extensive-Form Structure in Empirical Game-Theoretic Analysis. WINE 2022: 132-149 - 2021
- [j9]Mithun Chakraborty
Picking sequences and monotonicity in weighted fair division. Artif. Intell. 301: 103578 (2021) - [j8]Mithun Chakraborty
Weighted Envy-freeness in Indivisible Item Allocation. ACM Trans. Economics and Comput. 9(3): 18:1-18:39 (2021) - [j7]Nawal Benabbou, Mithun Chakraborty
Finding Fair and Efficient Allocations for Matroid Rank Valuations. ACM Trans. Economics and Comput. 9(4): 21:1-21:41 (2021) - [c15]Blake Martin, Mithun Chakraborty
Timing is money: the impact of arrival order in beta-bernoulli prediction markets. ICAIF 2021: 41:1-41:9 - [c14]Mithun Chakraborty
Picking Sequences and Monotonicity in Weighted Fair Division. IJCAI 2021: 82-88 - [i15]Feiran Jia, Aditya Mate, Zun Li, Shahin Jabbari, Mithun Chakraborty, Milind Tambe, Michael P. Wellman, Yevgeniy Vorobeychik:
A Game-Theoretic Approach for Hierarchical Policy-Making. CoRR abs/2102.10646 (2021) - [i14]Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Picking Sequences and Monotonicity in Weighted Fair Division. CoRR abs/2104.14347 (2021) - [i13]Zun Li, Feiran Jia, Aditya Mate, Shahin Jabbari, Mithun Chakraborty, Milind Tambe, Yevgeniy Vorobeychik:
Solving Structured Hierarchical Games Using Differential Backward Induction. CoRR abs/2106.04663 (2021) - [i12]Mithun Chakraborty, Erel Segal-Halevi, Warut Suksompong:
Weighted Fairness Notions for Indivisible Items Revisited. CoRR abs/2112.04166 (2021) - 2020
- [j6]Nawal Benabbou, Mithun Chakraborty
The Price of Quota-based Diversity in Assignment Problems. ACM Trans. Economics and Comput. 8(3): 14:1-14:32 (2020) - [c13]Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick:
Weighted Envy-Freeness in Indivisible Item Allocation. AAMAS 2020: 231-239 - [c12]Nawal Benabbou, Mithun Chakraborty
Finding Fair and Efficient Allocations When Valuations Don't Add Up. SAGT 2020: 32-46 - [i11]Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations When Valuations Don't Add Up. CoRR abs/2003.07060 (2020)
2010 – 2019
- 2019
- [j5]Nawal Benabbou, Mithun Chakraborty, Yair Zick:
Fairness and Diversity in Public Resource Allocation Problems. IEEE Data Eng. Bull. 42(3): 64-75 (2019) - [c11]Nawal Benabbou, Mithun Chakraborty
Fairness Towards Groups of Agents in the Allocation of Indivisible Items. IJCAI 2019: 95-101 - [i10]Mithun Chakraborty, Warut Suksompong, Yair Zick:
On Weighted Envy-Freeness in Indivisible Item Allocation. CoRR abs/1909.10502 (2019) - 2018
- [c10]Nawal Benabbou, Mithun Chakraborty, Xuan-Vinh Ho, Jakub Sliwinski, Yair Zick:
Diversity Constraints in Public Housing Allocation. AAMAS 2018: 973-981 - 2017
- [c9]Mithun Chakraborty
Coordinated Versus Decentralized Exploration In Multi-Agent Multi-Armed Bandits. IJCAI 2017: 164-170 - [i9]Nawal Benabbou, Mithun Chakraborty, Vinh Ho Xuan, Jakub Sliwinski, Yair Zick:
Diversity Constraints in Public Housing Allocation. CoRR abs/1711.10241 (2017) - 2016
- [c8]Mithun Chakraborty, Sanmay Das:
Trading on a Rigged Game: Outcome Manipulation in Prediction Markets. IJCAI 2016: 158-164 - 2015
- [c7]Mithun Chakraborty, Sanmay Das, Justin Peabody:
Price Evolution in a Continuous Double Auction Prediction Market With a Scoring-Rule Based Market Maker. AAAI 2015: 835-841 - [c6]Mithun Chakraborty, Sanmay Das:
Market Scoring Rules Act As Opinion Pools For Risk-Averse Agents. NIPS 2015: 2359-2367 - [i8]Mithun Chakraborty, Sanmay Das, Allen Lavoie:
How to show a probabilistic model is better. CoRR abs/1502.03491 (2015) - 2014
- [i7]Mithun Chakraborty, Sanmay Das:
On Manipulation in Prediction Markets When Participants Influence Outcomes Directly. CoRR abs/1407.7015 (2014) - 2013
- [c5]Mithun Chakraborty, Sanmay Das, Allen Lavoie, Malik Magdon-Ismail, Yonatan Naamad:
Instructor Rating Markets. AAAI 2013: 159-165 - 2012
- [c4]Aseem Brahma, Mithun Chakraborty
A bayesian market maker. EC 2012: 215-232 - [i6]Mithun Chakraborty, Sanmay Das, Malik Magdon-Ismail:
Near-Optimal Target Learning With Stochastic Binary Signals. CoRR abs/1202.3704 (2012) - 2011
- [j4]Pabitra Pal Choudhury, Sudhakar Sahoo, Mithun Chakraborty
Characterization of the Evolution of Nonlinear Uniform Cellular Automata in the Light of Deviant States. Int. J. Math. Math. Sci. 2011: 605098:1-605098:16 (2011) - [c3]Mithun Chakraborty
Instructor Rating Markets. AMMA 2011: 31-32 - [c2]Mithun Chakraborty, Sanmay Das, Malik Magdon-Ismail:
Near-Optimal Target Learning With Stochastic Binary Signals. UAI 2011: 69-76
2000 – 2009
- 2009
- [j3]Pabitra Pal Choudhury, Sudhakar Sahoo, Mithun Chakraborty
Investigation of the global dynamics of cellular automata using Boolean derivatives. Comput. Math. Appl. 57(8): 1337-1351 (2009) - [j2]Deepyaman Maiti, Mithun Chakraborty
A partly deterministic and partly stochastic scheme for the identification of fractional-order processes. Int. J. Adv. Intell. Paradigms 1(3): 332-357 (2009) - 2008
- [j1]Deepyaman Maiti, Mithun Chakraborty
Complete identification of dynamic physical systems using a five parameter model. Int. J. Intell. Def. Support Syst. 1(3): 189-224 (2008) - [c1]Pabitra Pal Choudhury, Sudhakar Sahoo, Mithun Chakraborty
Implementation of Basic Arithmetic Operations Using Cellular Automaton. ICIT 2008: 79-80 - [i5]Sudhakar Sahoo, Pabitra Pal Choudhury, Mithun Chakraborty:
Characterization Of any Non-linear Boolean function Using A Set of Linear Operators. CoRR abs/0808.1641 (2008) - [i4]Mithun Chakraborty, Deepyaman Maiti, Amit Konar:
The Application of Stochastic Optimization Algorithms to the Design of a Fractional-order PID Controller. CoRR abs/0811.0079 (2008) - [i3]Deepyaman Maiti, Ayan Acharya, Mithun Chakraborty, Amit Konar, Ramadoss Janarthanan:
Tuning PID and FOPID Controllers using the Integral Time Absolute Error Criterion. CoRR abs/0811.0083 (2008) - [i2]Mithun Chakraborty, Deepyaman Maiti, Amit Konar, Ramadoss Janarthanan:
A Study of the Grunwald-Letnikov Definition for Minimizing the Effects of Random Noise on Fractional Order Differential Equations. CoRR abs/0811.0133 (2008) - [i1]Deepyaman Maiti, Mithun Chakraborty, Amit Konar:
A Novel Approach for Complete Identification of Dynamic Fractional Order Systems Using Stochastic Optimization Algorithms and Fractional Calculus. CoRR abs/0811.0137 (2008)
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-12-26 00:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: