Siddharth Barman
siddharthbarman.bsky.social
Siddharth Barman
@siddharthbarman.bsky.social
Economics 38%
Computer science 28%

Reposted by Siddharth Barman

We are organizing the 8th Games, Agents, and Incentives Workshop
(GAIW) @aamasconf.bsky.social 2026; this time in Cyprus!

Submit your amazing papers (published, unpublished, and even half-baked but well-written ideas)

Webpage: gtep-workshops.github.io/gaiw2026/
Welcome to GAIW 2026
A Workshop at AAMAS 2026
gtep-workshops.github.io

Reposted by Siddharth Barman

𝐈𝐂𝐋𝐑 𝟐𝟎𝟐𝟔 𝐚𝐜𝐜𝐞𝐩𝐭𝐚𝐧𝐜𝐞: 𝐀𝐝𝐬 𝐭𝐡𝐚𝐭 𝐒𝐭𝐢𝐜𝐤

Most ad systems still do something very simple.
They space ads uniformly, or impose crude caps, and hope for the best.
Humans, unfortunately, are not uniform.

This paper asks a basic question:
What if ad scheduling actually respected how human attention works?

Reposted by Siddharth Barman

Congratulations to my NYU colleagues Oded Regev and Ted Rappaport for being named ACM Fellows --- and also to Ken-ichi Kawarabayashi, Jian Ma (@jianma.bsky.social), Noam Nisan, Ariel Procaccia, and Adam Wierman!!

www.acm.org/media-center...
2025 ACM Fellows’ Excellence and Impact Recognized by World’s Preeminent Computing Society
ACM, the Association for Computing Machinery, has named 71 new Fellows. ACM Fellows are registered members of the society and were selected by their peers for achieving remarkable results through thei...
www.acm.org

Reposted by Siddharth Barman

A fun-filled week of 𝗴𝗿𝗮𝗽𝗵 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 at IISc, a truly 𝗻𝗲𝘁𝘄𝗼𝗿𝗸𝗲𝗱 and 𝗱𝘆𝗻𝗮𝗺𝗶𝗰 event 𝗱𝗶𝘀𝘁𝗿𝗶𝗯𝘂𝘁𝗲𝗱 over five days, 𝘀𝘁𝗿𝗲𝗮𝗺𝗲𝗱 𝗼𝗻𝗹𝗶𝗻𝗲 and 𝗰𝗼𝗻𝗻𝗲𝗰𝘁𝗶𝗻𝗴 over 150 in-person participants from multiple countries. By many 𝗽𝗮𝗿𝗮𝗺𝗲𝘁𝗲𝗿𝘀, the 𝗯𝗶𝗴𝗴𝗲𝘀𝘁 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 𝗲𝘃𝗲𝗻𝘁 ever in India!

#IISc #India #Algorithms #Graph

Reposted by Siddharth Barman

I just gave a tutorial on Design Templates for Dynamic Graph Algorithms at IISc in Bangalore.

The kindest words I received were "best tutorial I have listened to in the last 10 years." Hope it interests you.

Video: www.youtube.com/live/L8ev24g...
Slides: tinyurl.com/yetx3vxu
Frontiers of Graph Algorithms | Day 1 | 8th Dec 2025
YouTube video by CSAChannel IISc
www.youtube.com

Reposted by Siddharth Barman

🚀 Biggest-ever Algorithms event in India -- starts tomorrow!

Thrilled to share that we are organizing the Frontiers of Graph Algorithms Workshop, happening from December 8–12, 2025, at the IISc! 🎓

Streaming Link: www.youtube.com/playlist?lis...

Details:
algo.csa.iisc.ac.in/graphworkshop/

Reposted by Siddharth Barman

The 2026 SIGecom job market candidate profiles are now available online!

Share the following article with anyone who may be interested in hiring at the intersection of computer science, operations research, and economics:
www.sigecom.org/exchanges/vo...
www.sigecom.org

Reposted by Siddharth Barman

Egor Gagushin, Marios Mertzanidis, Alexandros Psomas
On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
https://arxiv.org/abs/2511.03810

Reposted by Siddharth Barman

Hadi Hosseini, Shraddha Pathak, Yu Zhou
Non-Monotonicity in Fair Division of Graphs
https://arxiv.org/abs/2511.03629

Reposted by Siddharth Barman

Registration Open: Ajit Diwan Memorial Workshop on Geometry, Graph, and Combinatorics.

📅 Dates: January 19–20, 2026
📍 Venue: RKMVERI, Belur

- No registration fee.
- Free boarding and lodging for participants.

cs.rkmvu.ac.in/ADMemorialWo...
Ajit Diwan Memorial Workshop
cs.rkmvu.ac.in

Reposted by Siddharth Barman

It is that time of year again to gather all the profiles of SIGecom job market candidates!

Share this with any job market candidate at the intersection of Econ, CS, and OR that you may know.

Candidates should complete the submission form (docs.google.com/forms/d/e/1F...) by October 7th, 2025.
SIGecom Job Candidates 2025-2026
Just like in the last 10 years, this year there will be an article in SIGecom Exchanges profiling the current junior job market candidates from the SIGecom community. These profiles will include a res...
docs.google.com

Reposted by Siddharth Barman

Siddharth Barman, Paritosh Verma
Proximately Envy-Free and Efficient Allocation of Mixed Manna
https://arxiv.org/abs/2509.18673

Reposted by Siddharth Barman

🚀 Biggest Graph Algorithms Workshop in India!

Walmart Center for Tech Excellence (WACE) at CSA, IISc is organizing the Frontiers of Graph Algorithms Workshop, happening during December 8–12, 2025 at the Indian Institute of Science (IISc), Bengaluru! 🎓

Details: algo.csa.iisc.ac.in/graphworkshop/

Reposted by Siddharth Barman

✨ Magic of Algorithms: Scheduling for Muggles ✨

Remember Hermione in Prisoner of Azkaban?
She wanted to attend all her classes—Care of Magical Creatures, Arithmancy, Muggle Studies … but schedules overlapped. Her secret weapon? The time-turner. ⏳
For us mere muggles, we dn’t have time-turners. 1/n

Reposted by Siddharth Barman

🚀 What connects Mohan Bhargava (SRK) in Swades and Otakar Borůvka in Moravia?
👉 Minimum Spanning Tree (MST).

In Swades, SRK faced the challenge of connecting all village homes to the power plant at min cost. Borůvka solved the same for electrification of Moravia in 1926 —the first MST algorithm.

Reposted by Siddharth Barman

🚀 Dynamic Programming through "Lord of the Rings".

🪄 Gandalf’s Memoization: Top-Down strategy, uses a memo to avoid repeated work.
🧝‍♂️ Frodo’s Bottom-Up Journey: Start from foothills & climb up to reach Mount Doom.

English: www.youtube.com/watch?v=16t5...
Bengali: www.youtube.com/watch?v=Ap55...

Reposted by Siddharth Barman

How Sanskrit Poetry led to the discovery of recursion & binary numbers!

🎬 English video: [https://www.youtube.com/watch?v=pBCGOCA2_wc] (with explanations using Sanskrit chhandas)

🎬 Bengali video: [https://www.youtube.com/watch?v=FJWm5RiBMmc] (explanations using Bengali chhandas)

#Algorithms #CS

Reposted by Siddharth Barman

🚀 How can Sanskrit poetry connect to computer science?

The challenge of generating poetry in Varnavrutta (syllable-based metres) gave rise to the discovery of binary numbers.

The exploration of Mātrāvṛtta led to the ideas of recursion & DP.

Video links below.

#Algorithms #Prosody #Sanskrit

Reposted by Siddharth Barman

A PhD may have only one name on the certificate, but it’s a team sport.
Here’s to my village — I couldn’t have done it without you. 🙏

Image: From the acknowledgement page of my thesis -- alluding to rectangle packing. My thesis was on approximation algorithms on multidimensional bin packing.

Reposted by Siddharth Barman

A historic day for the Algorithms community in India -- SoCG'27 coming to India -- IISc Bangalore!

#SoCG #IISc #Bangalore

Reposted by Siddharth Barman

A privilege to be learn fundamental algorithms by the very authors themselves. "For more details, refer to [Garg, Vazirani, Yanakakis, STOC'92]", says Garg.

Approx Algo School @IISc

Reposted by Siddharth Barman

Livestream: www.youtube.com/playlist?lis...

More info: algo.csa.iisc.ac.in/summerschool...

This is a great opportunity to learn from the legends: Naveen Garg (IITD), Amit Kumar (IITD), Neeldhara Misra (IIT GN), Akash Kumar (IITB), and Prajakta Nimbhorkar (CMI).
Summer School on Approximation Algorithms 2025 - YouTube
Supported by the Walmart Center for Tech Excellence. Welcome to our Summer School on Theoretical Computer Science, an enriching opportunity designed for seni...
www.youtube.com

Reposted by Siddharth Barman

Walmart Center for Tech Excellence (WACE) at the Indian Institute of Science (IISc) is organizing a summer school on Approximation Algorithms from tomorrow (during May 21-25).

The event will be livestreamed and open to all!

#Algorithms #Approximation #SummerSchool #livestream #Walmart
Summer School on Approximation Algorithms 2025 - YouTube
Supported by the Walmart Center for Tech Excellence. Welcome to our Summer School on Theoretical Computer Science, an enriching opportunity designed for seni...
www.youtube.com

Reposted by Siddharth Barman

Umang Bhaskar, Vishwa Prakash HV, Aditi Sethia, Rakshitha
Best of Both Worlds Guarantees for Equitable Allocations
https://arxiv.org/abs/2505.05809

Reposted by Siddharth Barman

R3: Please cite and discuss Verne, J. (1865).

Reposted by Siddharth Barman

"We choose to go to the moon, and do the other things, not because"

R1: I am not convinced by the practical relevance of the task. The authors should expand on why their focus is on the moon and not, eg, Mars.

R2: Please expand on "the other things." Absent this, I am not able to assess the work.

Reposted by Siddharth Barman

Zhiyi Huang, Chui Shan Lee, Xinkai Shu, Zhaozi Wang
The Long Arm of Nashian Allocation in Online $p$-Mean Welfare Maximization
https://arxiv.org/abs/2504.13430

Reposted by Siddharth Barman

🛫 🚘 Suppose that you got a new job, and need to relocate to a new city (Bangalore?) & have many stuff (items/boxes) to pack into your suitcases (bins/boxes). Can you pack all items into the minimum number of suitcases?

New paper on this fundamental problem - 3D bin packing
arxiv.org/pdf/2503.08863
arxiv.org

Reposted by Siddharth Barman

EECS Research Student Symposium at IISc is a forum for presentations by students & postdocs from CSA and other departments in EECS Division at IISc.

Proud and delighted to see PhD student Debajyoti Kar as the recipient of the "Best Presentation Award" in Theory CS for his talk on 3D Bin Packing.

Reposted by Siddharth Barman

I am looking for a postdoc candidate. Here are some details. Could you please help me spread the word? Thanks! Application deadline: April 22, 2025.
candidate.hr-manager.net/ApplicationI...
Postdoc position in Algebraic Complexity Theory at the IT University of Copenhagen
The Algorithms group at IT University of Copenhagen invites highly motivated persons for one funded postdoc position in Algebraic Complexity Theory starting 1 J
candidate.hr-manager.net