BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.18.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20260313
DTEND;VALUE=DATE:20260315
DTSTAMP:20260310T143924Z
CREATED:20260218T082136Z
LAST-MODIFIED:20260310T143924Z
UID:89496-1773360000-1773532799@www.ashoka.edu.in
SUMMARY:Short courses on Information Theory and Algorithmic Game Theory
DESCRIPTION:Short Courses Announcement\n\n\n\n\n \n\nInformation Theory and its applications in communication\, combinatorics\, computer science\, and statistics\nJaikumar Radhakrishnan \nDistinguished Professor\nInternational Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru \n\n\nAbstract: We will begin by discussing the problem of information transmission and the main theorems of Shannon. We will introduce fundamental information theoretic quantities such as entropy\, conditional entropy\, relative entropy and mutual information and review the inequalities relating these quantities. Finally\, we will present applications of the standard information theoretic inequalities in combinatorics\, computer science and statistics. We will assume some familiarity with the basics of probability\, but otherwise our discussion will be self-contained.\n  \nBio: Jaikumar Radhakrishnan is a theoretical computer scientist with research interests in complexity theory\, randomness and computation\, quantum information and computation\, combinatorics\, and information theory. Radhakrishnan obtained his BTech in Computer Science and Engineering from IIT Kharagpur in 1985\, and his PhD in Computer Science from Rutgers University\, NJ\, USA\, in 1991. He joined the Tata Institute of Fundamental Research in 1991; in 2024 he moved to the International Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru.\n\n\n\n \n\nA Short Course on Economics and Computation\nRohit Vaish \nAssistant Professor\nDepartment of Computer Science and Engineering\, Indian Institute of Technology Delhi \n\n\nAbstract: The course will provide an introduction to algorithmic game theory\, which focuses on the design and analysis of algorithms in strategic environments. We will start by examining various types of “real-life” games\, understanding the role that algorithms play in these situations\, and exploring how incorrect incentives can lead to suboptimal outcomes. Following that\, we will discuss some fun problems in the related area of computational social choice\, including how computer science can prevent strategic manipulation in elections\, and how to set up dates that are provably free of breakups.\n  \nBio: Rohit Vaish is an Assistant Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Delhi. His research is at the interface of computer science and economics\, specifically in the area of computational social choice. He explores collective decision-making scenarios\, including voting\, matching\, and fair division\, through a computational lens.\n\n\n\n\nSchedule: \n\n\n March 13\,2026:  \n\n\nJaikumar Radhakrishnan: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Information Theory) \n\n\nRohit Vaish: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Algorithmic Game Theory) \n\n\n\n\nMarch 14\,2026: \n\n\nRohit Vaish: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Algorithmic Game Theory) \n\n\nJaikumar Radhakrishnan: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Information Theory) \nClick here to download the schedule\n\n\n\n\n\n\nRegistration link: https://forms.gle/PzToLmB9LdKHfsds6\nDate: March 13-14\, 2026\nVenue: Admin-LR-305\nFor details: scdlds@ashoka.edu.in\nWebsite: https://scdlds.ashoka.edu.in/
URL:https://www.ashoka.edu.in/event/scdlds-sc02-2/
LOCATION:AC-04-LR-310
CATEGORIES:Online Event,Offline
ATTACH;FMTTYPE=image/png:https://www.ashoka.edu.in/wp-content/uploads/2026/02/scdlds-sc02.png
ORGANIZER;CN="SCDLDS":MAILTO:ashoka-cdlds@ashoka.edu.in
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260313T000000
DTEND;TZID=Asia/Kolkata:20260329T235500
DTSTAMP:20260311T235420Z
CREATED:20260311T235420Z
LAST-MODIFIED:20260311T235420Z
UID:90278-1773360000-1774828500@www.ashoka.edu.in
SUMMARY:ACC x De Beers Inter-University Case Competition
DESCRIPTION:
URL:https://www.ashoka.edu.in/event/acc-x-de-beers-interuniversity-case-competition/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260313T090000
DTEND;TZID=Asia/Kolkata:20260314T173500
DTSTAMP:20260309T053055Z
CREATED:20260218T025523Z
LAST-MODIFIED:20260309T053055Z
UID:89501-1773392400-1773509700@www.ashoka.edu.in
SUMMARY:Short courses on Information Theory and Algorithmic Game Theory
DESCRIPTION:Information Theory and its applications in communication\, combinatorics\, computer science\, and statistics\nJaikumar Radhakrishnan \nDistinguished Professor International Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru \n\n\nAbstract: We will begin by discussing the problem of information transmission and the main theorems of Shannon. We will introduce fundamental information theoretic quantities such as entropy\, conditional entropy\, relative entropy and mutual information and review the inequalities relating these quantities. Finally\, we will present applications of the standard information theoretic inequalities in combinatorics\, computer science and statistics. We will assume some familiarity with the basics of probability\, but otherwise our discussion will be self-contained. \nBio: Jaikumar Radhakrishnan is a theoretical computer scientist with research interests in complexity theory\, randomness and computation\, quantum information and computation\, combinatorics\, and information theory. Radhakrishnan obtained his BTech in Computer Science and Engineering from IIT Kharagpur in 1985\, and his PhD in Computer Science from Rutgers University\, NJ\, USA\, in 1991. He joined the Tata Institute of Fundamental Research in 1991; in 2024 he moved to the International Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru. \n\n\n \n\n \n\nA Short Course on Economics and Computation\nRohit Vaish \nAssistant Professor Department of Computer Science and Engineering\, Indian Institute of Technology Delhi \n\n\nAbstract: The course will provide an introduction to algorithmic game theory\, which focuses on the design and analysis of algorithms in strategic environments. We will start by examining various types of “real-life” games\, understanding the role that algorithms play in these situations\, and exploring how incorrect incentives can lead to suboptimal outcomes. Following that\, we will discuss some fun problems in the related area of computational social choice\, including how computer science can prevent strategic manipulation in elections\, and how to set up dates that are provably free of breakups. \nBio: Rohit Vaish is an Assistant Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Delhi. His research is at the interface of computer science and economics\, specifically in the area of computational social choice. He explores collective decision-making scenarios\, including voting\, matching\, and fair division\, through a computational lens. \n\n\n\n \n\nSchedule: \n\nMarch 13\, 2026:\n\nJaikumar Radhakrishnan: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Information Theory)\nRohit Vaish: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Algorithmic Game Theory)\n\n\nMarch 14\, 2026:\n\nRohit Vaish: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Algorithmic Game Theory)\nJaikumar Radhakrishnan: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Information Theory)
URL:https://www.ashoka.edu.in/event/short-courses-on-information-theory-and-algorithmic-game-theory/
ATTACH;FMTTYPE=image/png:https://www.ashoka.edu.in/wp-content/uploads/2026/02/scdlds-sc02.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260313T094500
DTEND;TZID=Asia/Kolkata:20260314T180000
DTSTAMP:20260310T235900Z
CREATED:20260310T235610Z
LAST-MODIFIED:20260310T235900Z
UID:90248-1773395100-1773511200@www.ashoka.edu.in
SUMMARY:Short Courses on Information Theory and Algorithmic Game Theory
DESCRIPTION:Information Theory and its applications in communication\, combinatorics\, computer science\, and statistics\nJaikumar Radhakrishnan \nDistinguished Professor International Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru \n\n\nAbstract: We will begin by discussing the problem of information transmission and the main theorems of Shannon. We will introduce fundamental information theoretic quantities such as entropy\, conditional entropy\, relative entropy and mutual information and review the inequalities relating these quantities. Finally\, we will present applications of the standard information theoretic inequalities in combinatorics\, computer science and statistics. We will assume some familiarity with the basics of probability\, but otherwise our discussion will be self-contained. \nBio: Jaikumar Radhakrishnan is a theoretical computer scientist with research interests in complexity theory\, randomness and computation\, quantum information and computation\, combinatorics\, and information theory. Radhakrishnan obtained his BTech in Computer Science and Engineering from IIT Kharagpur in 1985\, and his PhD in Computer Science from Rutgers University\, NJ\, USA\, in 1991. He joined the Tata Institute of Fundamental Research in 1991; in 2024 he moved to the International Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru. \n\n\n \n \n\nA Short Course on Economics and Computation\nRohit Vaish \nAssistant Professor Department of Computer Science and Engineering\, Indian Institute of Technology Delhi \n\n\nAbstract: The course will provide an introduction to algorithmic game theory\, which focuses on the design and analysis of algorithms in strategic environments. We will start by examining various types of "real-life" games\, understanding the role that algorithms play in these situations\, and exploring how incorrect incentives can lead to suboptimal outcomes. Following that\, we will discuss some fun problems in the related area of computational social choice\, including how computer science can prevent strategic manipulation in elections\, and how to set up dates that are provably free of breakups. \nBio: Rohit Vaish is an Assistant Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Delhi. His research is at the interface of computer science and economics\, specifically in the area of computational social choice. He explores collective decision-making scenarios\, including voting\, matching\, and fair division\, through a computational lens. \n\n\n\n \n\nSchedule: \n\nMarch 13\, 2026:\n\nJaikumar Radhakrishnan: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Information Theory)\nRohit Vaish: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Algorithmic Game Theory)\n\n\nMarch 14\, 2026:\n\nRohit Vaish: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Algorithmic Game Theory)\nJaikumar Radhakrishnan: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Information Theory)
URL:https://www.ashoka.edu.in/event/short-courses-on-information-theory-and-algorithmic-game-theory/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260314T115000
DTEND;TZID=Asia/Kolkata:20260314T163000
DTSTAMP:20260310T235830Z
CREATED:20260307T064752Z
LAST-MODIFIED:20260310T235830Z
UID:90054-1773489000-1773505800@www.ashoka.edu.in
SUMMARY:History and Practice of Preserving Historic Monuments
DESCRIPTION:Dear All\, \nThe Department of Visual Arts is delighted to invite you to a two-day Seminar on 13th &14th March\, 2026. \nThe Seminar will have workshops conducted by Professor Béla Zsolt SZAKÁCS\, Art Historian\, Department of Historical Studies at the Central European University\, Vienna\, and head of the Art History Department\, the Pázmány Péter Catholic University\, Budapest. \nWorkshop Title: History and Practice of Preserving Historic Monuments\nDate: 14th March 2026 \nSession 1: Lecture and Discussion – 11:50 am to 1:20 pm\nSession 2: Lecture and Discussion – 3:00 pm to 4:30 pm \nVenue: Visual Art Studio (near sports block) \nSIGN UP for the workshop here. \nHistoric monuments bear witness not only to their date of origin but also to the reinterpretations of the centuries. Whether of deliberate political propaganda or ever-changing scientific concepts. This Seminar reviews the history of heritage conservation as a history of constant reinterpretation from anitquity to the present day. \nAbout the Speaker: Béla Zsolt SZAKÁCS (PhD 1998\, Doctor of the Hungarian Academy of Sciences 2024) lectures in Art History at the Department of Historical Studies at the Central European University in Vienna\, and head of the Art History Department at the Pázmány Péter Catholic University in Budapest. He is particularly interested in Romanesque architecture in Central Europe\, Christian iconography and the history of monument protection. He is editor and co-author of an overview on photographic collections in East-Central Europe (Guide to Visual Resources of Medieval East Central Europe\, Budapest 2002) and published a monograph on the iconography of the 14th-centrury Hungarian Angevin Legendary (Budapest 2006\, in English as The Visual World of the Hungarian Angevin Legendary\, Budapest 2016). He is involved in various ongoing projects that concern the medieval heritage of East Central Europe\, resulting in monographies on Romanesque architecture in Western Hungary (Budapest 2021) and Early Gothic churches in Spiš and Šariš counties in Slovakia (Budapest 2023). \nWe welcome interested students\, faculty and staff members to join the seminar.  \nLooking forward to your active participation in the workshop. \n  \nWarm regards\, \nVisual Arts Department
URL:https://www.ashoka.edu.in/event/history-and-practice-of-preserving-historic-monuments/
END:VEVENT
END:VCALENDAR