Game Theory Seminar

11:30-12:30 Two-Sided Matching with Partial Participation

• Asaf Romm
• Bloomfield 424

11:30-12:30 Privacy Preserving Auctions

• Ran Eilat
• Bloomfield 424

11:30-12:30 Convergence rate of \ell^p-energy minimization on graphs

• Gidi Amir
• Bloomfield 424

12:30-13:15 Frankenmandering: The confluence and symbiosis of opinion dynamics and gerrymandering

• Playtime Seminar
• Zinovi Rabinovich
• Bloomfield 424

11:30-12:30 Describing Deferred Acceptance and Strategyproofness to Participants: Experimental Analysis

• Ori Heffetz
• Bloomfield 424

11:30-12:30 Keeping in the Dark with Hard Evidence

• Daniel Bird

11:30-12:30 The Trivial Obviously Strategy-Proof Mechanism Is Optimal

• Shiri Ron
• Bloomfield 527

11:30-12:30 Monetizing innovations in conflicts

• Shiran Rachmilevitch
• Bloomfield 424

10:30-11:30 An FPTAS for 7/9-Approximation to Maximin Share Allocations

• Xin Huang
• Bloomfield 526

11:30-12:30 What Are People’s Actual Utility Functions in Budget Aggregation?

• Erel Segal-Halevi
• Bloomfield 424

11:30-12:30 Computational and Statistical Limits in Modern Machine Learning – Job Talk

• Job Talk
• Idan Attias
• Bloomfield 424

11:30-12:30 Multi-Attribute Committee Selection: Diversity, Correlation, and Approximation Guarantees

• Playtime Seminar
• Doron Heller
• Bloomfield 424

11:30-12:30 Serial Monopoly on Blockchains

• Noam Nisan
• Bloomfield 424

11:30-12:30 Machine-Learning to Trust

• Ran Spiegler
• Bloomfield 424

11:30-12:30 Bargaining and Compromise

• مئير رشاف
• Bloomfield 424

11:30-12:30 The Domain of RSD Characterization by Efficiency, Symmetry, and Strategy-Proofness

• Playtime Seminar
• Maor Ben Zaquen
• Bloomfield 424

Unending Sequential Auctions

• Amir Ban
• Bloomfield 424

11:30-12:30 Searching for Arms: Experimentation with Endogenous Consideration Sets

• Daniel Fershtman
• Bloomfield 424

11:30-12:30 Decentralized Persuasion

• Ronen Gradwohl
• Bloomfield 424

11:30-12:30 Creating closed lists for proportional elections: Mechanism design for inner-coalition elections

• Estelle Varloot
• Bloomfield, 424

11:30-12:30 Testing Decision Makers without Counterfactuals.

• ببيتشينكو يعقوب
• Bloomfield 424

11:30-12:30 Fast swap regret minimization and applications

• Aviad Rubinstein
• Bloomfield, Room 424

11:30-12:30 Bayesian Persuasion in Networks: Divisibility and Network Irrelevance

• Yevgeny Tsodikovich
• Bloomfield 424

11:30-12:30 Magical Implementation

• Ariel Rubinstein
• Bloomfield 424

11:30-12:30 Blackwell’s Approachability with Approximation Algorithms

• جيربر دان
• Bloomfield 424

11:30-12:30 Stable Marriage: Loyalty vs. Competition

• Alon Ede
• Bloomfield 424

11:30-12:30 An Epistemic Model with Boundedly-Rational Players

• Mikhail Panov
• Bloomfield 424

11:30-12:30 “Calibeating”: Beating Forecasters at Their Own Game

• Sergiu Hart
• Bloomfield 424

11:30-12:30 Share-Based Fairness for Arbitrary Entitlements

• Moshe Babaioff
• Bloomfield 527

11:30-12:30 A bidding game for allocation of indivisible goods

• Uriel Feige
• Bloomfield 424

11:30-12:30 Aligning Machine Learning with Society

• Lee Cohen
• Bloomfield, 424

11:30-12:30 Revealed Preference Tests for Bayesian Persuasion

• Jeffrey Mensch
• Bloomfield 424

11:30-12:30 The edge-averaging process on graphs with random initial opinions

• Ron Peretz
• Bloomfield 424

11:30-12:30 Motivated Misspecification

• Mingzi Niu
• Bloomfield 424

11:30-12:30 Comparison of Oracles

• David Lagziel
• Bloomfield 424