default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSachin Adlakha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c24]Rahul Ahlawat
, Sachin Adlakha, Medhavi Malik, Nishtha Jatana:
Action and Gesture Recognition using Deep Learning and Computer Vision for Deaf and Dumb People. ICIMMI 2023: 79:1-79:8
2010 – 2019
- 2015
- [j5]Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintraub:
Equilibria of dynamic games with many players: Existence, approximation, and market structure. J. Econ. Theory 156: 269-316 (2015) - 2014
- [c23]Jayakrishnan Nair, Sachin Adlakha, Adam Wierman:
Energy procurement strategies in the presence of intermittent sources. SIGMETRICS 2014: 85-97 - 2013
- [j4]Sachin Adlakha, Ramesh Johari:
Mean Field Equilibrium in Dynamic Games with Strategic Complementarities. Oper. Res. 61(4): 971-989 (2013) - 2012
- [j3]Sachin Adlakha, Sanjay Lall, Andrea Goldsmith:
Networked Markov Decision Processes With Delays. IEEE Trans. Autom. Control. 57(4): 1013-1018 (2012) - [c22]Vinod Ramaswamy, Sachin Adlakha, Srinivas Shakkottai, Adam Wierman:
Incentives for P2P-assisted content distribution: If you can't beat 'em, join 'em. Allerton Conference 2012: 1409-1416 - [i4]Vinod Ramaswamy, Sachin Adlakha, Srinivas Shakkottai, Adam Wierman:
Incentives for P2P-Assisted Content Distribution: If You Can't Beat 'Em, Join 'Em. CoRR abs/1212.3853 (2012) - 2011
- [c21]Desmond W. H. Cai, Sachin Adlakha, K. Mani Chandy:
Optimal contract for wind power in day-ahead electricity markets. CDC/ECC 2011: 1521-1527 - 2010
- [c20]Sachin Adlakha, Ramesh Johari:
Mean field equilibrium in dynamic games with complementarities. Allerton 2010: 805 - [c19]Ramesh Johari, Sachin Adlakha, Gabriel Y. Weintraub:
Asymptotic analysis of large population stochastic games. BQGT 2010: 68:1 - [c18]Reza Mirghaderi, Sachin Adlakha, Sanjay Lall, Andrea J. Goldsmith:
Hat guessing games and the use of coding for decentralized control. CDC 2010: 979-985 - [c17]Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintraub, Andrea J. Goldsmith:
On oblivious equilibrium in large population stochastic games. CDC 2010: 3117-3124 - [c16]Sachin Adlakha, Ramesh Johari:
Mean field equilibrium in dynamic games with complementarities. CDC 2010: 6633-6638 - [i3]Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintraub:
Equilibria of Dynamic Games with Many Players: Existence, Approximation, and Market Structure. CoRR abs/1011.5537 (2010) - [i2]Sachin Adlakha, Ramesh Johari:
Mean Field Equilibrium in Dynamic Games with Complementarities. CoRR abs/1011.5677 (2010)
2000 – 2009
- 2009
- [c15]Sachin Adlakha, Seyed Reza Mirghaderi, Sanjay Lall, Andrea Goldsmith:
Decentralized team decision via coding. Allerton 2009: 151 - [c14]Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintraub, Andrea Goldsmith:
Oblivious equilibrium: An approximation to large population dynamic games with concave utility. GAMENETS 2009: 68-69 - [c13]Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintraub, Andrea Goldsmith:
A mean field approach to competition in large scale wireless systems. S³@MobiHoc 2009: 13-16 - 2008
- [c12]Sachin Adlakha, Sanjay Lall, Andrea Goldsmith:
A Bayesian network approach to control of networked Markov decision processes. Allerton 2008: 446-451 - [c11]Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintraub, Andrea Goldsmith:
Oblivious equilibrium for stochastic games with concave utility. Allerton 2008: 1304-1308 - [c10]Sachin Adlakha, Sanjay Lall, Andrea J. Goldsmith:
Information state for Markov decision processes with network delays. CDC 2008: 3840-3847 - [c9]Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintraub, Andrea J. Goldsmith:
Oblivious equilibrium for large-scale stochastic games with unbounded costs. CDC 2008: 5531-5538 - 2007
- [j2]Sachin Adlakha, Ranjan K. Mallik, Anshu Vazirani:
Multiuser Detection Techniques for TH-PPM Systems. IEEE Trans. Veh. Technol. 56(5): 2915-2921 (2007) - [c8]Sachin Adlakha, Bruno Sinopoli, Andrea Goldsmith:
Optimal Sensing Rate for Estimation over Shared Communication Links. ACC 2007: 5043-5045 - [c7]Sachin Adlakha, Ritesh Madan, Sanjay Lall, Andrea J. Goldsmith:
Optimal control of distributed Markov decision processes with network delays. CDC 2007: 3308-3314 - [c6]Sachin Adlakha, Xiaoqing Zhu, Bernd Girod, Andrea J. Goldsmith:
Joint Capacity, Flow and Rate Allocation for Multiuser Video Streaming Over Wireless Ad-Hoc Networks. ICC 2007: 1747-1753 - [i1]Sachin Adlakha, Ramesh Johari, Andrea J. Goldsmith:
Competition in Wireless Systems via Bayesian Interference Games. CoRR abs/0709.0516 (2007) - 2006
- [c5]Sachin Adlakha, Ranjan K. Mallik, Anshu Vazirani:
Multiuser Detection Techniques for TH-PPM Systems. ICC 2006: 4959-4964 - 2005
- [j1]Gautam Kulkarni, Sachin Adlakha, Mani B. Srivastava:
Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks. IEEE Trans. Mob. Comput. 4(6): 652-662 (2005) - 2003
- [c4]Andreas Savvides, Wendy L. Garber, Sachin Adlakha, Randolph L. Moses, Mani B. Srivastava:
On the Error Characteristics of Multihop Node Localization in Ad-Hoc Sensor Networks. IPSN 2003: 317-332 - [c3]Sachin Adlakha, Saurabh Ganeriwal, Curt Schurgers, Mani B. Srivastava:
Density, accuracy, delay and lifetime tradeoffs in wireless sensor networks - a multidimensional design perspective. SenSys 2003: 296-297 - [c2]Sachin Adlakha, Mani B. Srivastava:
Critical density thresholds for coverage in wireless sensor networks. WCNC 2003: 1615-1620 - 2002
- [c1]Steven H. Low, Fernando Paganini, Jiantao Wang, Sachin Adlakha, John Doyle:
Dynamics of TCP/RED and a Scalable Control. INFOCOM 2002: 239-248
Coauthor Index
aka: Andrea Goldsmith
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-09-02 01:01 CEST 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:
