Person:221890: Difference between revisions

From MaRDI portal
Person:221890
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Xiaotie Deng to Xiaotie Deng: Duplicate
 
(No difference)

Latest revision as of 01:16, 9 December 2023

Available identifiers

zbMath Open deng.xiao-tieMaRDI QIDQ221890

List of research outcomes





PublicationDate of PublicationType
Optimal private payoff manipulation against commitment in extensive-form games2025-01-17Paper
Tight incentive analysis of Sybil attacks against the market equilibrium of resource exchange over general networks2025-01-17Paper
Equilibrium analysis of customer attraction games2024-09-20Paper
Improved truthful rank approximation for rank-maximal matchings2024-09-20Paper
A survey on algorithms for Nash equilibria in finite normal-form games2024-06-12Paper
Truthfulness of a Network Resource-Sharing Protocol2024-02-27Paper
Insightful mining equilibria2023-08-04Paper
On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium2023-07-17Paper
ABSNFT: securitization and repurchase scheme for non-fungible tokens based on game theoretical analysis2023-05-26Paper
Distributed near-optimal matching2022-08-30Paper
Recent studies of agent incentives in Internet resource allocation and pricing2022-08-01Paper
Study on Agent Incentives for Resource Sharing on P2P Networks2022-07-22Paper
Incentive ratio: a game theoretical analysis of market equilibria2022-06-08Paper
Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design2022-06-08Paper
On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium2022-06-01Paper
Understanding PPA-completeness2020-10-23Paper
On Bayesian epistemology of Myerson auction2020-07-07Paper
https://portal.mardi4nfdi.de/entity/Q51112302020-05-26Paper
Multi‐Unit Bayesian Auction with Demand or Budget Constraints2019-11-27Paper
A novel business model for electric car sharing2019-10-11Paper
Agent incentives of strategic behavior in resource exchange2019-06-20Paper
Recent studies of agent incentives in internet resource allocation and pricing2019-02-22Paper
Limiting User’s Sybil Attack in Resource Sharing2019-01-30Paper
Network pollution games2019-01-11Paper
A polynomial-time approximation scheme for embedding hypergraph in a cycle2018-11-05Paper
Agent incentives of strategic behavior in resource exchange2018-02-13Paper
Understanding PPA-completeness2017-10-10Paper
Power-Law Distributions in a Two-Sided Market and Net Neutrality2017-02-10Paper
New Results for Network Pollution Games2016-09-02Paper
On revenue maximization with sharp multi-unit demands2016-04-13Paper
The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line2016-04-13Paper
Settling the complexity of computing two-player Nash equilibria2015-11-11Paper
Can Bandwidth Sharing Be Truthful?2015-11-04Paper
https://portal.mardi4nfdi.de/entity/Q55018522015-08-14Paper
Envy-free pricing in multi-item markets2015-08-14Paper
Universally balanced combinatorial optimization games2015-05-19Paper
Recent development in computational complexity characterization of Nash equilibrium2014-10-07Paper
Revenue maximization in a Bayesian double auction market2014-06-06Paper
Pricing Ad Slots with Consecutive Multi-unit Demand2013-10-23Paper
https://portal.mardi4nfdi.de/entity/Q28439282013-08-27Paper
Revenue Maximization in a Bayesian Double Auction Market2013-03-21Paper
Algorithmic Solutions for Envy-Free Cake Cutting2013-03-12Paper
Incentive Ratios of Fisher Markets2012-11-01Paper
Multi-bidding strategy in sponsored search auctions2012-07-03Paper
Equiseparability on terminal Wiener index2012-06-14Paper
Discrete Fixed Points: Models, Complexities, and Applications2012-05-24Paper
On incentive compatible competitive selection protocols2011-09-20Paper
How Profitable Are Strategic Behaviors in a Market?2011-09-16Paper
Approximate Rank Aggregation2011-03-18Paper
Majority Equilibrium for Public Facility Allocation2011-03-18Paper
Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets2010-09-07Paper
Envy-Free Pricing in Multi-item Markets2010-09-07Paper
Finding nucleolus of flow game2010-08-16Paper
On algorithms for discrete and approximate brouwer fixed points2010-08-16Paper
On the complexity of equilibria2010-08-05Paper
The computation of approximate competitive equilibrium is PPAD-hard2010-06-09Paper
Forward looking Nash equilibrium for keyword auction2010-03-24Paper
On the complexity of market equilibria with maximum social welfare2009-12-18Paper
On the complexity of 2D discrete fixed point problem2009-11-04Paper
Finding nucleolus of flow game2009-09-02Paper
Equiseparability on Terminal Wiener Index2009-07-02Paper
A simplicial approach for discrete fixed point theorems2009-04-29Paper
On the complexity of crossings in permutations2009-04-09Paper
On the Complexity of 2D Discrete Fixed Point Problem2009-03-12Paper
A More Natural Way to Construct Identity-Based Identification Schemes2009-03-10Paper
Properties of Symmetric Incentive Compatible Auctions2009-03-06Paper
Matching algorithmic bounds for finding a Brouwer fixed point2008-12-21Paper
Two-factor mutual authentication based on smart cards and passwords2008-11-19Paper
Arbitrage opportunities across sponsored search markets2008-11-18Paper
A new framework for the design and analysis of identity-based identification schemes2008-11-18Paper
Algorithmic Cooperative Game Theory2008-10-17Paper
Double Auction in Two-Level Markets2008-09-30Paper
Optimal dynamic portfolio selection with earnings-at-risk2008-09-23Paper
Multi-bidding Strategy in Sponsored Keyword Auction2008-06-19Paper
https://portal.mardi4nfdi.de/entity/Q54418372008-02-15Paper
Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set2008-01-04Paper
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics2007-12-20Paper
On Walrasian price of CPU time2007-10-10Paper
Efficient Anonymous Roaming and Its Security Analysis2007-09-24Paper
Certificateless signature: a new security model and an improved generic construction2007-09-20Paper
On Incentive Compatible Competitive Selection Protocol2007-09-10Paper
A Simplicial Approach for Discrete Fixed Point Theorems2007-09-10Paper
Key Replacement Attack Against a Generic Construction of Certificateless Signature2007-09-07Paper
Public Key Cryptography - PKC 20062007-05-02Paper
A new numerical method an American option pricing2007-02-20Paper
Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers2007-01-24Paper
https://portal.mardi4nfdi.de/entity/Q34157632007-01-19Paper
https://portal.mardi4nfdi.de/entity/Q34157772007-01-19Paper
Computation of arbitrage in frictional bond markets2007-01-09Paper
Graph Drawing2006-11-13Paper
Information Security2006-10-20Paper
Information Security and Privacy2006-06-22Paper
Condorcet winners for public goods2006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q33711432006-02-21Paper
A linear programming algorithm for optimal portfolio selection with transaction costs2006-02-14Paper
Computing and Combinatorics2006-01-11Paper
On convergence of a semi-analytical method for American option pricing2005-12-16Paper
Algorithmic Applications in Management2005-11-30Paper
A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs2005-11-30Paper
A Min-Max Theorem on Feedback Vertex Sets2005-11-11Paper
Automata, Languages and Programming2005-08-24Paper
Automata, Languages and Programming2005-08-24Paper
Algorithms – ESA 20042005-08-18Paper
https://portal.mardi4nfdi.de/entity/Q30247672005-07-04Paper
COMPUTATIONAL COMPLEXITY OF ARBITRAGE IN FRICTIONAL SECURITY MARKET2005-06-22Paper
A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING2005-06-22Paper
A minimax portfolio selection strategy with equilibrium2005-06-01Paper
A PTAS for semiconductor burn-in scheduling2005-05-17Paper
On-line scheduling a batch processing system to minimize total weighted job completion time2005-03-15Paper
On complexity of single-minded auction2005-02-23Paper
On the complexity of price equilibria2004-11-18Paper
Approximate and dynamic rank aggregation2004-10-27Paper
Minimizing mean completion time in a batch processing system2004-09-22Paper
Minimum \(k\) arborescences with bandwidth constraints2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q47372042004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47375352004-08-11Paper
Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44740712004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741042004-08-04Paper
Portfolio selection theory with different interest rates for borrowing and lending2004-03-15Paper
Approximation algorithms in batch processing2004-01-06Paper
On computational complexity of membership test in flow games and linear production games2003-11-23Paper
Genetic Design of Drugs Without Side-Effects2003-09-28Paper
Optimal portfolio selection of assets with transaction costs and no short sales2003-09-12Paper
Approximate sequencing for variable length tasks.2003-08-17Paper
Total balancedness condition for Steiner tree games.2003-06-10Paper
Center and distinguisher for strings with unbounded alphabet2003-06-09Paper
Symmetric duality for a class of multiobjective fractional programming problems.2003-02-11Paper
https://portal.mardi4nfdi.de/entity/Q45369612002-11-06Paper
Dynamic Arbitrage-Free Asset Pricing with Proportional Transaction Costs2002-09-19Paper
https://portal.mardi4nfdi.de/entity/Q45513632002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q27796062002-04-15Paper
A compromise solution to mutual funds portfolio selection with transaction costs2002-02-27Paper
https://portal.mardi4nfdi.de/entity/Q27519652002-02-12Paper
Robot map verification of a graph world2002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q47096362002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27290972001-10-23Paper
Wavelength allocation on trees of rings2001-10-14Paper
A 2-D parallel convex hull algorithm with optimal communication phases2001-08-20Paper
An Approximation Algorithm for Feedback Vertex Sets in Tournaments2001-06-21Paper
Totally balanced combinatorial optimization games2001-06-10Paper
https://portal.mardi4nfdi.de/entity/Q45271882001-04-26Paper
https://portal.mardi4nfdi.de/entity/Q45269762001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q45257582001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q47886022001-01-01Paper
On approximating a scheduling problem2001-01-01Paper
Solution to a problem on degree sequences of graphs2000-12-13Paper
Graph algorithms with small communication costs2000-12-03Paper
Preemptive Scheduling of Parallel Jobs on Multiprocessors2000-10-18Paper
Algorithmic Aspects of the Core of Combinatorial Optimization Games2000-07-19Paper
Decision-making by hierarchies of discordant agents2000-07-10Paper
https://portal.mardi4nfdi.de/entity/Q49533312000-06-22Paper
Exploring an unknown graph2000-01-03Paper
A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors2000-01-03Paper
https://portal.mardi4nfdi.de/entity/Q27668402000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47031451999-12-14Paper
https://portal.mardi4nfdi.de/entity/Q42637031999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42534771999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42474471999-09-23Paper
How to learn an unknown environment. I1999-01-11Paper
https://portal.mardi4nfdi.de/entity/Q43945991998-12-10Paper
https://portal.mardi4nfdi.de/entity/Q43757431998-02-08Paper
Distributed near-optimal matching1998-01-07Paper
On multiprocessor system scheduling1998-01-01Paper
The Cost of Derandomization: Computability or Competitiveness1997-05-26Paper
A lower bound for communication on the crossbar1997-02-28Paper
A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers1997-01-01Paper
Competitive distributed decision-making1996-11-17Paper
https://portal.mardi4nfdi.de/entity/Q48751801996-09-15Paper
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs1996-06-04Paper
https://portal.mardi4nfdi.de/entity/Q31404501994-11-29Paper
On the Complexity of Cooperative Solution Concepts1994-08-21Paper
https://portal.mardi4nfdi.de/entity/Q39766461992-06-26Paper
On path lengths modulo three1992-06-25Paper
More powerful closure operations on graphs1992-06-25Paper
Server problems and resistive spaces1991-01-01Paper
An optimal parallel algorithm for linear programming in the plane1990-01-01Paper
Implicit-degrees and circumferences1989-01-01Paper

Research outcomes over time

This page was built for person: Xiaotie Deng