Amos Fiat

Yannai A. Gonczarowski

CoRR, 2023

Fair allocation in graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

An α-regret analysis of Adversarial Bilateral Trade.

[BibT_eX]

[DOI]

Federico Fusco

CoRR, 2022

An $\alpha$-regret analysis of Adversarial Bilateral Trade.

[BibT_eX]

[DOI]

Federico Fusco

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Almost Full EFX Exists for Four Agents.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Competitive Equilibria with Unequal Budgets: Supporting Arbitrary Pareto Optimal Allocations.

[BibT_eX]

[DOI]

CoRR, 2021

(Almost Full) EFX Exists for Four Agents (and Beyond).

[BibT_eX]

[DOI]

CoRR, 2021

An Economics-Based Analysis of RANKING for Online Bipartite Matching.

[BibT_eX]

[DOI]

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

2019

Beyond myopic best response (in Cournot competition).

[BibT_eX]

[DOI]

Games Econ. Behav., 2019

Energy Equilibria in Proof-of-Work Mining.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Anna R. Karlin

Elias Koutsoupias

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Efficient Allocation of Free Stuff.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Dynamic Pricing of Servers on Trees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

2018

Flow Equilibria via Online Surge Pricing.

[BibT_eX]

[DOI]

Lior Shultz

CoRR, 2018

An Economic-Based Analysis of RANKING for Online Bipartite Matching.

[BibT_eX]

[DOI]

CoRR, 2018

Prompt Scheduling for Selfish Agents.

[BibT_eX]

[DOI]

CoRR, 2018

Interdependent Values without Single-Crossing.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Truthful Prompt Scheduling for Minimizing Sum of Completion Times.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

(1 + ∊)-Approximate <i>f</i>-Sensitive Distance Oracles.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Makespan Minimization via Posted Prices.

[BibT_eX]

[DOI]

Michal Feldman

Alan Roytman

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016

Highway Dimension and Provably Efficient Shortest Path Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2016

Packing Small Vectors.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

The FedEx Problem.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

On Voting and Facility Location.

[BibT_eX]

[DOI]

Michal Feldman

Iddan Golomb

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Lottery Pricing Equilibria.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Invisible Hand of Dynamic Market Pricing.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

History-Independent Distributed Multi-agent Learning.

[BibT_eX]

[DOI]

Mariano Schain

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Carpooling in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Variations on the Hotelling-Downs Model.

[BibT_eX]

[DOI]

Michal Feldman

Svetlana Obraztsova

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Provable Unlinkability Against Traffic Analysis with Low Message Overhead.

[BibT_eX]

[DOI]

J. Cryptol., 2015

Minimal indices for predecessor search.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Pricing Online Decisions: Beyond Auctions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

The Temp Secretary Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2013

A Labeling Approach to Incremental Cycle Detection.

[BibT_eX]

[DOI]

CoRR, 2013

Minimal Indices for Successor Search.

[BibT_eX]

[DOI]

CoRR, 2013

Minimal Indices for Successor Search - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Approaching utopia: strong truthfulness and externality-resistant mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Envy-Free Makespan Approximation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Why study the price of anarchy?: technical perspective.

[BibT_eX]

[DOI]

Commun. ACM, 2012

Tight Lower Bounds on Envy-Free Makespan Approximation.

[BibT_eX]

[DOI]

Renato Fonseca F. Werneck

Ariel Levavi

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Revenue maximizing envy-free multi-unit auctions with budgets.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

HLDB: location-based services in databases.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

2011

Derandomization of auctions.

[BibT_eX]

[DOI]

Games Econ. Behav., 2011

Special Issue: European Symposium on Algorithms, Design and Analysis.

[BibT_eX]

[DOI]

Renato Fonseca F. Werneck

Algorithmica, 2011

Truth, Envy, and Truthful Market Clearing Bundle Pricing.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Single valued combinatorial auctions with budgets.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

VC-Dimension and Shortest Path Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

On the Interplay between Incentive Compatibility and Envy Freeness

[BibT_eX]

[DOI]

CoRR, 2010

Truth and Envy in Capacitated Allocation Games

[BibT_eX]

[DOI]

CoRR, 2010

Combinatorial Auctions with Budgets

[BibT_eX]

[DOI]

CoRR, 2010

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms.

[BibT_eX]

[DOI]

Ittai Abraham

Renato Fonseca F. Werneck

Andrew V. Goldberg

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Envy-free makespan approximation: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

When the Players Are Not Expectation Maximizers.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Envy, Multi Envy, and Revenue Maximization.

[BibT_eX]

[DOI]

Amiram Wingarten

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Private coresets.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Caching Content under Digital Rights Management.

[BibT_eX]

[DOI]

Leah Epstein

Meital Levy

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Competitive queue management for latency sensitive packets.

[BibT_eX]

[DOI]

Uri Nadav

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Subjective vs.Objective Reality - The Risk of Running Late.

[BibT_eX]

[DOI]

Hila Pochter

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

Censorship Resistant Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Jared Saia

Theory Comput., 2007

Online Conflict-Free Coloring for Intervals.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Associative search in peer to peer networks: Harnessing latent semantics.

[BibT_eX]

[DOI]

Edith Cohen

Comput. Networks, 2007

Efficient contention resolution protocols for selfish agents.

[BibT_eX]

[DOI]

Uri Nadav

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Strong Price of Anarchy for Machine Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

Bi-criteria linear-time approximations for generalized k-mean/median/center.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Correlation clustering in general weighted graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

An improved algorithm for online coloring of intervals with bandwidth.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.

[BibT_eX]

[DOI]

Stefano Leonardi

SIAM J. Comput., 2006

On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Coresets forWeighted Facilities and Their Applications.

[BibT_eX]

[DOI]

Dan Feldman

Micha Sharir

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Digital Signatures for Modifiable Collections.

[BibT_eX]

[DOI]

Proceedings of the The First International Conference on Availability, 2006

2005

Online conflict-free coloring for intervals.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Making Chord Robust to Byzantine Attacks.

[BibT_eX]

[DOI]

Jared Saia

Maxwell Young

Proceedings of the Algorithms, 2005

Secure Exchange of Modifiable Data and Queries.

[BibT_eX]

Proceedings of the 21èmes Journées Bases de Données Avancées, 2005

2004

Foreword.

[BibT_eX]

[DOI]

Sandy Irani

Theor. Comput. Sci., 2004

Optimal oblivious routing in polynomial time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Provable Unlinkability against Traffic Analysis.

[BibT_eX]

[DOI]

Ron Berman

Amnon Ta-Shma

Proceedings of the Financial Cryptography, 2004

Decision Trees: More Theoretical Justification for Practical Algorithms.

[BibT_eX]

[DOI]

Dmitry Pechyony

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

Better Algorithms for Unfair Metrical Task Systems and Applications.

[BibT_eX]

[DOI]

Manor Mendel

SIAM J. Comput., 2003

Making data structures confluently persistent.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Competitive distributed file allocation.

[BibT_eX]

[DOI]

Inf. Comput., 2003

A case for associative peer to peer overlays.

[BibT_eX]

[DOI]

Edith Cohen

Comput. Commun. Rev., 2003

Efficient sequences of trials.

[BibT_eX]

[DOI]

Edith Cohen

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

AIM: Another Itemset Miner.

[BibT_eX]

[DOI]

Sagi Shporer

Proceedings of the FIMI '03, 2003

Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs.

[BibT_eX]

[DOI]

Dotan Emanuel

Proceedings of the Algorithms, 2003

2002

Competitive generalized auctions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Censorship resistant peer-to-peer content addressable networks.

[BibT_eX]

[DOI]

Jared Saia

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Dynamically Fault-Tolerant Content Addressable Networks.

[BibT_eX]

[DOI]

Proceedings of the Peer-to-Peer Systems, First International Workshop, 2002

Online Companion Caching.

[BibT_eX]

[DOI]

Manor Mendel

Steven S. Seiden

Proceedings of the Algorithms, 2002

2001

Dynamic Traitor Tracing.

[BibT_eX]

[DOI]

Tamir Tassa

J. Cryptol., 2001

Optimal Search and One-Way Trading Online Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2001

On-Line Competitive Algorithms for Call Admission in Optical Networks.

[BibT_eX]

[DOI]

Algorithmica, 2001

Spectral analysis of data.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Some Recent Results on Data Mining and Search.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Web Search via Hub Synthesis.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Tracing traitors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1999

Rigorous Time/Space Trade-offs for Inverting Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

On Capital Investment.

[BibT_eX]

[DOI]

Algorithmica, 1999

On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Acta Informatica, 1999

Dynamic Traitor Training.

[BibT_eX]

[DOI]

Tamir Tassa

Proceedings of the Advances in Cryptology, 1999

1998

Competitive Algorithms for Layered Graph Traversal.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Distributed Paging for General Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1998

1997

Batch RSA.

[BibT_eX]

[DOI]

J. Cryptol., 1997

On-line routing of virtual circuits with applications to load balancing and machine scheduling.

[BibT_eX]

[DOI]

J. ACM, 1997

Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard?

[BibT_eX]

[DOI]

Ziv Rosen

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Truly Online Paging with Locality of Reference.

[BibT_eX]

[DOI]

Manor Mendel

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).

[BibT_eX]

[DOI]

Frank Thomson Leighton

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Randomized Robot Navigation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Packet Routing via Min-Cost Circuit Routing.

[BibT_eX]

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

On-line Competive Algorithms for Call Admission in Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1996

Competitive Odds and Ends.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Proceedings of the Online Algorithms, 1996

Competitive Analysis of Algorithms.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Proceedings of the Online Algorithms, 1996

1995

Competitive Algorithms for Distributed Data Management.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

New Algorithms for an Ancient Scheduling Problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Randomized and multipointer paging with locality of reference.

[BibT_eX]

[DOI]

Anna R. Karlin

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Competitive Algorithms for the Weighted Server Problem.

[BibT_eX]

[DOI]

Moty Ricklin

Theor. Comput. Sci., 1994

Competitive k-Server Algorithms.

[BibT_eX]

[DOI]

Yiftach Ravid

J. Comput. Syst. Sci., 1994

Online Navigation in a Room.

[BibT_eX]

[DOI]

J. Algorithms, 1994

A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.

[BibT_eX]

[DOI]

Algorithmica, 1994

Competitive Non-Preemptive Call Control.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Matching Nuts and Bolts.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Tracing Traitors.

[BibT_eX]

[DOI]

Benny Chor

Proceedings of the Advances in Cryptology, 1994

1993

Implicit O(1) Probe Search.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

On-line load balancing with applications to machine scheduling and virtual circuit routing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Heat & Dump: Competitive Distributed Paging

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Broadcast Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1993

1992

Nonoblivious Hashing.

[BibT_eX]

[DOI]

J. ACM, 1992

Competitive Algorithms for Distributed Data Management (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On-Line Navigation in a Room.

[BibT_eX]

[DOI]

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Competitive Analysis of Financial Games

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time.

[BibT_eX]

[DOI]

J. Ian Munro

Alejandro A. Schäffer

Jeanette P. Schmidt

Alan Siegel

J. Comput. Syst. Sci., 1991

Competitive Paging Algorithms.

[BibT_eX]

[DOI]

Daniel Dominic Sleator

Neal E. Young

J. Algorithms, 1991

Rigorous Time/Space Tradeoffs for Inverting Functions

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1990

Competitive k-Server Algorithms (Extended Abstract)

[BibT_eX]

[DOI]

Yiftach Ravid

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

How to find a battleship.

[BibT_eX]

[DOI]

Networks, 1989

Planning and Learning in Permutation Groups

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Zero-Knowledge Proofs of Identity.

[BibT_eX]

[DOI]

Uriel Feige

J. Cryptol., 1988

Storing and Searching a Multikey Table (Extended Abstract)

[BibT_eX]

[DOI]

Alejandro A. Schäffer

Jeanette P. Schmidt

Alan Siegel

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Non-Oblivious Hashing (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Untraceable Electronic Cash.

[BibT_eX]

[DOI]

David Chaum

Proceedings of the Advances in Cryptology, 1988

1986

Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

How to Prove Yourself: Practical Solutions to Identification and Signature Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1986

1985

Polymorphic Arrays: An Architecture for a Programmable Systolic Machine.

[BibT_eX]

Ehud Shapiro

Proceedings of the International Conference on Parallel Processing, 1985

1984

Generalized 'write-once' memories.

[BibT_eX]

[DOI]