

<feed xmlns="http://www.w3.org/2005/Atom">
  <id>https://events.illc.uva.nl/FOAM/</id>
  <title>FOAM Seminar</title>
  <subtitle>Write an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description.</subtitle>
  <updated>2026-04-21T19:34:18+02:00</updated>
  <author>
    <name>ILLC TCS Group</name>
    <uri>https://events.illc.uva.nl/FOAM/</uri>
  </author>
  <link rel="self" type="application/atom+xml" href="https://events.illc.uva.nl/FOAM/feed.xml"/>
  <link rel="alternate" type="text/html" hreflang="en"
    href="https://events.illc.uva.nl/FOAM/"/>
  <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator>
  <rights> © 2026 ILLC TCS Group </rights>
  <icon>/FOAM/assets/img/favicons/favicon.ico</icon>
  <logo>/FOAM/assets/img/favicons/favicon-96x96.png</logo>


  
  <entry>
    <title>The Price of Anarchy of Simultaneous First-Price Auctions with Budgets</title>
    <link href="https://events.illc.uva.nl/FOAM/posts/talk33/" rel="alternate" type="text/html" title="The Price of Anarchy of Simultaneous First-Price Auctions with Budgets" />
    <published>2026-05-22T15:00:00+02:00</published>
  
    <updated>2026-05-22T15:00:00+02:00</updated>
  
    <id>https://events.illc.uva.nl/FOAM/posts/talk33/</id>
    <content src="https://events.illc.uva.nl/FOAM/posts/talk33/" />
    <author>
      <name>Twan Kroll</name>
    </author>

  
    
    <category term="Talks" />
    
  
   
  
	<room>LAB42 L2.06</room>
  

  
    <summary>
      





      Online advertising systems have recently transitioned to autobidding, allowing advertisers to delegate bidding decisions to automated agents. Each advertiser directs their agent to optimize an objective function subject to return-on-investment (ROI) and budget constraints. Given their practical relevance, this shift has spurred a surge of research on the liquid welfare price of anarchy (POA) of...
    </summary>
  

  </entry>

  
  <entry>
    <title>Foundations of Secure Multi-Party Computation</title>
    <link href="https://events.illc.uva.nl/FOAM/posts/talk32/" rel="alternate" type="text/html" title="Foundations of Secure Multi-Party Computation" />
    <published>2026-04-17T15:00:00+02:00</published>
  
    <updated>2026-04-17T15:00:00+02:00</updated>
  
    <id>https://events.illc.uva.nl/FOAM/posts/talk32/</id>
    <content src="https://events.illc.uva.nl/FOAM/posts/talk32/" />
    <author>
      <name>Divya Ravi</name>
    </author>

  
    
    <category term="Talks" />
    
  
   
  
	<room>LAB42 L2.06</room>
  

  
    <summary>
      





      Secure multiparty computation (MPC) enables a set of mutually distrusting parties to jointly compute a function over their private inputs while revealing nothing beyond the final output. Such guarantees are useful in settings where sensitive data must be processed jointly, including applications in healthcare and finance. This talk introduces the foundational ideas behind MPC, including formal ...
    </summary>
  

  </entry>

  
  <entry>
    <title>Picturing Quantum Software</title>
    <link href="https://events.illc.uva.nl/FOAM/posts/talk31/" rel="alternate" type="text/html" title="Picturing Quantum Software" />
    <published>2026-03-20T15:00:00+01:00</published>
  
    <updated>2026-03-20T15:00:00+01:00</updated>
  
    <id>https://events.illc.uva.nl/FOAM/posts/talk31/</id>
    <content src="https://events.illc.uva.nl/FOAM/posts/talk31/" />
    <author>
      <name>John van de Wetering</name>
    </author>

  
    
    <category term="Talks" />
    
  
   
  
	<room>LAB42 L1.07</room>
  

  
    <summary>
      





      The ZX-calculus is a graphical language for reasoning about quantum processes. In this talk I will give an overview of how we can use ZX-diagrams and a small set of rewrite rules to prove interesting properties regarding optimisation, verification, classical simulation and quantum error correction.


    </summary>
  

  </entry>

  
  <entry>
    <title>Approximate Axiomatics in Social Choice Theory</title>
    <link href="https://events.illc.uva.nl/FOAM/posts/talk30/" rel="alternate" type="text/html" title="Approximate Axiomatics in Social Choice Theory" />
    <published>2026-02-20T15:00:00+01:00</published>
  
    <updated>2026-02-20T15:00:00+01:00</updated>
  
    <id>https://events.illc.uva.nl/FOAM/posts/talk30/</id>
    <content src="https://events.illc.uva.nl/FOAM/posts/talk30/" />
    <author>
      <name>Patrick Lederer</name>
    </author>

  
    
    <category term="Talks" />
    
  
   
  
	<room>LAB42 L2.06</room>
  

  
    <summary>
      





      Social choice theory is broadly concerned with the formal study of collective decision making: a set of agents report preferences over a set of candidates that need to be aggregated into a collective decision. In economic theory, the standard approach to evaluating mechanisms for such problems, so-called voting rules, is to formalize desirable behavior of mechanisms as rigorous mathematical axi...
    </summary>
  

  </entry>

  
  <entry>
    <title>Graph-Theoretic Principles for Graph Learning Models</title>
    <link href="https://events.illc.uva.nl/FOAM/posts/talk29/" rel="alternate" type="text/html" title="Graph-Theoretic Principles for Graph Learning Models" />
    <published>2026-01-30T15:00:00+01:00</published>
  
    <updated>2026-01-30T15:00:00+01:00</updated>
  
    <id>https://events.illc.uva.nl/FOAM/posts/talk29/</id>
    <content src="https://events.illc.uva.nl/FOAM/posts/talk29/" />
    <author>
      <name>Gaurav Rattan</name>
    </author>

  
    
    <category term="Talks" />
    
  
   
  
	<room>LAB42 L2.06</room>
  

  
    <summary>
      





      Graph Neural Networks (GNNs) are deep learning models for graphs and networks. Despite the widespread popularity of GNNs in the practical setting, the mathematical principles underlying the design and analysis of these models are still not very well-understood. This naturally calls for a first-principles approach to machine learning on graphs, rooted in classical graph theory, as opposed to lev...
    </summary>
  

  </entry>

</feed>


