The following pages link to Evangelos Markakis (Q315521):
Displaying 50 items.
- On the stability of generalized second price auctions with budgets (Q315522) (← links)
- On multiprocessor temperature-aware scheduling problems (Q398885) (← links)
- Paradoxes in social networks with multiple products (Q516241) (← links)
- Item bidding for combinatorial public projects (Q526903) (← links)
- On core-selecting and core-competitive mechanisms for binary single-parameter auctions (Q777973) (← links)
- Uniform price auctions: equilibria and efficiency (Q904682) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
- An improved envy-free cake cutting protocol for four agents (Q1617649) (← links)
- Inequity aversion pricing over social networks: approximation algorithms and hardness results (Q2031049) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- Towards a characterization of worst case equilibria in the discriminatory price auction (Q2152113) (← links)
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination (Q2202022) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Cooperative games with overlapping coalitions: charting the tractability frontier (Q2321289) (← links)
- Characteristic function games with restricted agent interactions: core-stability and coalition structures (Q2634475) (← links)
- An approval-based model for single-step liquid democracy (Q2670941) (← links)
- Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets (Q2819463) (← links)
- Item Pricing for Combinatorial Public Projects (Q2830053) (← links)
- Inefficiency of Standard Multi-unit Auctions (Q2849330) (← links)
- Plurality Voting with Truth-Biased Agents (Q2856129) (← links)
- Arbitration and Stability in Cooperative Games with Overlapping Coalitions (Q2878745) (← links)
- On Multiprocessor Temperature-Aware Scheduling Problems (Q2897990) (← links)
- Influence Maximization in Switching-Selection Threshold Models (Q2938652) (← links)
- Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design (Q2959848) (← links)
- Cooperative Games with Overlapping Coalitions (Q3055803) (← links)
- Diffusion in Social Networks with Competing Products (Q3095275) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)
- Beyond Plurality: Truth-Bias in Binary Scoring Rules (Q3449549) (← links)
- Cost-Sharing Models in Participatory Sensing (Q3449580) (← links)
- Equilibria of Plurality Voting: Lazy and Truth-Biased Voters (Q3449586) (← links)
- The Web Graph as an Equilibrium (Q3449596) (← links)
- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics (Q3603463) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q4554942) (← links)
- (Q4608566) (← links)
- On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives (Q4614052) (← links)
- (Q4780788) (← links)
- Undominated Groves Mechanisms (Q4907834) (← links)
- Uniform Price Auctions: Equilibria and Efficiency (Q4910949) (← links)
- Cost sharing over combinatorial domains : Complement-free cost functions and beyond (Q5075756) (← links)
- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to $\ell_1$ Embeddability of Negative Type Metrics (Q5189507) (← links)
- Social Networks with Competing Products (Q5408617) (← links)
- Tight welfare guarantees for pure Nash equilibria of the uniform price auction (Q5894691) (← links)
- LATIN 2004: Theoretical Informatics (Q5901661) (← links)
- Tight welfare guarantees for pure Nash equilibria of the uniform price auction (Q5919605) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- A polynomial-time algorithm for 1/2-well-supported Nash equilibria in bimatrix games (Q6538681) (← links)
- Partial allocations in budget-feasible mechanism design: bridging multiple levels of service and divisible agents (Q6609125) (← links)
- Blockchain participation games (Q6609138) (← links)
