Travelled to:1 × Canada
1 × Portugal
14 × USA
Collaborated with:J.M.Kleinberg S.A.Plotkin Y.Rabani D.Kempe T.Wexler D.B.Shmoys V.Syrgkanis ∅ A.Gupta C.Stein R.Kleinberg G.Piliouras A.Hayrapetyan K.Aardal P.N.Klein H.C.Lin T.Roughgarden A.Walkover E.Anshelevich A.Dasgupta M.Charikar S.Guha A.Goel M.R.Henzinger F.T.Leighton F.Makedon S.Tragoudas
Talks about:network (8) approxim (6) problem (6) algorithm (5) flow (4) social (3) game (3) multicommod (2) constant (2) schedul (2)
Person: Éva Tardos
DBLP: Tardos:=Eacute=va
Contributed to:
2013200920082006
20052004
2003200320001999199719961995199319911990Wrote 19 papers:
- STOC-2013-SyrgkanisT #composition #performance
- Composable and efficient mechanisms (VS, ÉT), pp. 211–220.
- STOC-2009-KleinbergPT #game studies #learning #multi
- Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract (RK, GP, ÉT), pp. 533–542.
- STOC-2008-KleinbergT #network #social
- Balanced outcomes in social exchange networks (JMK, ÉT), pp. 295–304.
- STOC-2006-HayrapetyanTW #game studies
- The effect of collusion in congestion games (AH, ÉT, TW), pp. 89–98.
- ICALP-2005-KempeKT #network #social
- Influential Nodes in a Diffusion Model for Social Networks (DK, JMK, ÉT), pp. 1127–1138.
- ICALP-2005-LinRTW #exponential #fibonacci
- Braess’s Paradox, Fibonacci Numbers, and Exponential Inapproximability (HCL, TR, ÉT, AW), pp. 497–512.
- STOC-2004-Tardos #game studies #network
- Network games (ÉT), pp. 341–342.
- KDD-2003-KempeKT #network #social
- Maximizing the spread of influence through a social network (DK, JMK, ÉT), pp. 137–146.
- STOC-2003-AnshelevichDTW #design #network
- Near-optimal network design with selfish agents (EA, AD, ÉT, TW), pp. 511–520.
- STOC-2000-GuptaT #algorithm #approximate #classification #constant #problem
- A constant factor approximation algorithm for a class of classification problems (AG, ÉT), pp. 652–658.
- STOC-1999-CharikarGTS #algorithm #approximate #problem
- A Constant-Factor Approximation Algorithm for the k-Median Problem (MC, SG, ÉT, DBS), pp. 1–10.
- STOC-1999-GoelHPT #data transfer #network #problem #scheduling #set
- Scheduling Data Transfers in a Network and the Set Scheduling Problem (AG, MRH, SAP, ÉT), pp. 189–197.
- STOC-1997-KleinbergRT
- Allocating Bandwidth for Bursty Connections (JMK, YR, ÉT), pp. 664–673.
- STOC-1997-ShmoysTA #algorithm #approximate #problem
- Approximation Algorithms for Facility Location Problems (DBS, ÉT, KA), pp. 265–274.
- STOC-1996-RabaniT #distributed #network
- Distributed Packet Switching in Arbitrary Networks (YR, ÉT), pp. 366–375.
- STOC-1995-KleinbergT #approximate #network #problem
- Approximations for the disjoint paths problem in high-diameter planar networks (JMK, ÉT), pp. 26–35.
- STOC-1993-PlotkinT #bound #multi
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (SAP, ÉT), pp. 691–697.
- STOC-1991-LeightonMPSTT #algorithm #approximate #multi #performance #problem
- Fast Approximation Algorithms for Multicommodity Flow Problems (FTL, FM, SAP, CS, ÉT, ST), pp. 101–111.
- STOC-1990-KleinST #algorithm #approximate #concurrent #performance
- Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities (PNK, CS, ÉT), pp. 310–321.