The following pages link to Paolo Penna (Q294875):
Displaying 50 items.
- On the approximability of two tree drawing conventions (Q294876) (← links)
- Convergence to equilibrium of logit dynamics for strategic games (Q334931) (← links)
- Automated optimal OSP mechanisms for set systems. The case of small domains (Q777956) (← links)
- XOR-based schemes for fast parallel IP lookups (Q814923) (← links)
- Partial digest is hard to solve for erroneous input data (Q817811) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Logit dynamics with concurrent updates for local interaction potential games (Q893316) (← links)
- Imperfect best-response mechanisms (Q904687) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- The power of verification for one-parameter agents (Q1004286) (← links)
- Strongly polynomial-time truthful mechanisms in one shot (Q1014632) (← links)
- (Q1274318) (redirect page) (← links)
- Strictly-upward drawings of ordered search trees (Q1274319) (← links)
- Linear area upward drawings of AVL trees (Q1384187) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- The minimum range assignment problem on linear radio networks (Q1566370) (← links)
- The price of anarchy and stability in general noisy best-response dynamics (Q1621728) (← links)
- Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy (Q1708613) (← links)
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games (Q1755838) (← links)
- No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
- Data delivery by energy-constrained mobile agents (Q1796430) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- Optimal dislocation with persistent errors in subquadratic time (Q1987515) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- Two-way greedy: algorithms for imperfect rationality (Q2152097) (← links)
- Online scheduling of jobs with favorite machines (Q2289948) (← links)
- Independent lazy better-response dynamics on network games (Q2294066) (← links)
- On the approximability of the range assignment problem on radio networks in presence of selfish agents (Q2570125) (← links)
- Sequential solutions in machine scheduling games (Q2692292) (← links)
- (Q2753931) (← links)
- (Q2762500) (← links)
- Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
- On Computing the Total Displacement Number via Weighted Motzkin Paths (Q2819524) (← links)
- Logit Dynamics with Concurrent Updates for Local Interaction Games (Q2849298) (← links)
- On Sampling Simple Paths in Planar Graphs According to Their Lengths (Q2946419) (← links)
- Private Capacities in Mechanism Design (Q3182917) (← links)
- Optimal Dislocation with Persistent Errors in Subquadratic Time (Q3304135) (← links)
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem (Q3508564) (← links)
- New Constructions of Mechanisms with Verification (Q3613793) (← links)
- Online Train Disposition: To Wait or Not to Wait? (Q3649176) (← links)
- (Q4437512) (← links)
- (Q4437514) (← links)
- (Q4449245) (← links)
- (Q4474107) (← links)
- (Q4501535) (← links)
- (Q4501569) (← links)
- (Q4636607) (← links)
- (Q4673403) (← links)
- (Q4785466) (← links)
