Travelled to:1 × Canada
1 × Iceland
1 × United Kingdom
3 × USA
Collaborated with:S.Dobzinski N.Nisan A.Daniely G.Shahaf G.Christodoulou A.Kovács H.Levin A.Zohar T.Ball N.Bjørner A.Gember S.Itzhaky A.Karbyshev M.Sagiv A.Valadarsky
Talks about:combinatori (3) auction (3) mechan (2) truth (2) interdomain (1) inapproxim (1) complement (1) algorithm (1) bayesian (1) approxim (1)
Person: Michael Schapira
DBLP: Schapira:Michael
Contributed to:
2015
2014
2008200820062005Wrote 6 papers:
- STOC-2015-DanielySS
- Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension (AD, MS, GS), pp. 401–408.
- PLDI-2014-BallBGIKSSV #named #network #source code #towards #verification
- VeriCon: towards verifying controller programs in software-defined networks (TB, NB, AG, SI, AK, MS, MS, AV), p. 31.
- ICALP-A-2008-ChristodoulouKS #combinator
- Bayesian Combinatorial Auctions (GC, AK, MS), pp. 820–832.
- STOC-2008-LevinSZ #game studies
- Interdomain routing and games (HL, MS, AZ), pp. 57–66.
- STOC-2006-DobzinskiNS #combinator #random
- Truthful randomized mechanisms for combinatorial auctions (SD, NN, MS), pp. 644–652.
- STOC-2005-DobzinskiNS #algorithm #approximate #combinator
- Approximation algorithms for combinatorial auctions with complement-free bidders (SD, NN, MS), pp. 610–618.