The following pages link to V. Auletta (Q334929):
Displaying 43 items.
- (Q236808) (redirect page) (← links)
- Convergence to equilibrium of logit dynamics for strategic games (Q334931) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available (Q831148) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Logit dynamics with concurrent updates for local interaction potential games (Q893316) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- The power of verification for one-parameter agents (Q1004286) (← links)
- Multiple templates access of trees in parallel memory systems (Q1130315) (← links)
- A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933) (← links)
- Metastability of logit dynamics for coordination games (Q1755731) (← links)
- Randomized path coloring on binary trees. (Q1853533) (← links)
- Optimal pebble motion on a tree (Q1854411) (← links)
- Belief-invariant and quantum equilibria in games of incomplete information (Q2664942) (← links)
- (Q2753727) (← links)
- Logit Dynamics with Concurrent Updates for Local Interaction Games (Q2849298) (← links)
- Private Capacities in Mechanism Design (Q3182917) (← links)
- Minority Becomes Majority in Social Networks (Q3460778) (← links)
- New Constructions of Mechanisms with Verification (Q3613793) (← links)
- (Q4250414) (← links)
- (Q4377122) (← links)
- Embedding graphs onto the Supercube (Q4419684) (← links)
- A new approach to optimal planning of robot motion on a tree with obstacles (Q4595513) (← links)
- Information Retention in Heterogeneous Majority Dynamics (Q4614055) (← links)
- Placing resources in a tree: Dynamic and static algorithms (Q4645181) (← links)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338) (← links)
- Mechanisms for Scheduling with Single-Bit Private Values (Q4910929) (← links)
- Routing selfish unsplittable traffic (Q4962692) (← links)
- Strategic monitor placement against malicious flows (Q4999202) (← links)
- On the effectiveness of social proof recommendations in markets with multiple products (Q4999203) (← links)
- Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- Contrasting the Spread of Misinformation in Online Social Networks (Q5139596) (← links)
- STACS 2004 (Q5309735) (← links)
- Alternatives to Truthfulness Are Hard to Recognize (Q5459984) (← links)
- Automata, Languages and Programming (Q5466459) (← links)
- Structural Information and Communication Complexity (Q5710093) (← links)
- Approximation and Online Algorithms (Q5713443) (← links)
- (Q5743454) (← links)
- Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← links)
